Square Cake Sizes

In a remote village, there is a unique tradition where the village baker prepares square-shaped cakes to celebrate various festivals. The baker has an upper limit n for the cake size and wants to list all the possible sizes of the square cakes that can be made. Each cake's size corresponds to a perfect square number.

Your task is to write a program that, given an upper bound n, outputs all perfect squares less than or equal to n. Mathematically, you need to find all numbers of the form \(i^2\) where \(i\) is a positive integer and \(i^2 \leq n\).

Input/Output Format: The input will be read from standard input and the output should be written to standard output.

inputFormat

The input consists of a single integer n (\(1 \leq n \leq 10^6\)) representing the upper limit for the perfect squares.

outputFormat

Output all the perfect squares less than or equal to n separated by a single space. There should be no extra spaces at the beginning or end of the output.

1

1