Create a graph as a representation of the following problem: The numbers from 1 to n must be placed in a circle so that neighbors always add them to a square number, for example, 1 and 8 gives 9 which is a square. The question is, what is the smallest value of n so that the circle is closed?
