eolymp
bolt
Try our new interface for solving problems
Problems

Representable with sum of squares

Representable with sum of squares

Time limit 1 second
Memory limit 128 MiB

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

Input data

One positive integer n (n10000).

Output data

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

Examples

Input example #1
20
Output example #1
5 10 13 17 20