An $**$Automorphic Number$**$ is a number whose square ends with the number itself. For example, $25$ is an automorphic number because $\backslash ($$$25^\{2\}$$ $=625\backslash ),$ and the result ends with $25.$

Write a program that identifies all automorphic numbers between $1$ and $10000.$ Each automorphic number should be printed on a single line, followed by its square. Format the output as: "Number: n$,$ Square: s$".$

the program should not employ string slicing techniques like $`[-$len$($n$)$:$]`$ to verify if the square ends with the number itself.