#C7383. Perfect Squares

    ID: 51248 Type: Default 1000ms 256MiB

Perfect Squares

Perfect Squares

Given a non-negative integer \(N\) (with \(0 \le N \le 10^5\)), your task is to output all the perfect squares less than or equal to \(N\). A perfect square is an integer that can be expressed as \(n^2\) for some integer \(n\). For example, when \(N = 10\), the perfect squares are 1, 4, and 9.

If \(N = 0\) then there are no perfect squares to output (print an empty line).

inputFormat

The input consists of a single integer \(N\) read from standard input.

outputFormat

Print all perfect squares less than or equal to \(N\> in ascending order, separated by a single space. If there are no perfect squares, output an empty line.

## sample
10
1 4 9

</p>