We derived an asymptotic formula for the number of pairs of integers which are mutually squares. Earlier results dealt with pairs of integers subject to the restriction that they are both odd, co-prime and squrefree. Here we remove all these restrictions and prove (similar to the best known one with restrictions) that the number of such pair of integers upto a large real X is asymptotic to cX2logX with an absolute constant c which we give explicitly. Our error term is also compatible to the best known one.