eolymp
Problems

Representable with sum of squares

Representable with sum of squares

Find all numbers from 1 to n, representable with the sum of two squares of different positive integers.

Input

One positive integer n (n10000).

Output

Print in one line in increasing order all numbers from 1 to n, representable with the sum of two squares of different positive integers.

Time limit 1 second
Memory limit 128 MiB
Input example #1
20
Output example #1
5 10 13 17 20