Decompose a $6\times 6$ square into unit squares and consider the $49$ vertices of these unit squares. We call a square good if its vertices are among the $49$ points and if its sides and diagonals do not lie on the gridlines of the $6\times 6$ square. Find the total number of good squares. Prove that there exist two good disjoint squares such that the smallest distance between their vertices is $1/\sqrt{5}.$