beecrowd | 1371
# Close the Doors!

**Timelimit: 1**

By Alessandro Luna de Almeida, UFPE

BrazilMadam Beauvoir has a mansion where she hosts her descendants (grandchildren and great-grandchildren) during their vacations. Her mansion has exactly N rooms (each room is numbered from 1 to N), and she has exactly N descendants (each descendant is also numbered from 1 to N).

Like all children, Mme. Beauvoir's descendants are really prankish. It's always the same mess: Every day, they wake up early in the morning before her, and meet in the garden. Then, each descendant, one at a time, enters the mansion and *switch the state* of the door of the rooms whose number is a multiple of his own number. *To switch the state* of a door means to close an open door or to open a closed door. So, for example, the descendant 15 will switch the state of the door of the rooms 15, 30, 45, and so on.

Initially, all doors are closed (all descendants close the doors before going to the garden). Also, each descendant enters exactly one time in the mansion (due to the mess, however, we don't know in which order). Which doors will be open once all descendants have entered the mansion?

The input consists of several test cases. Each test case is described by a line containing the integer **N** (0 ≤ **N** ≤ 25000000), the number of rooms and descendants. The last test case is followed by a line containing a single 0.

For each test case, print the numbers of the rooms whose door will be open, in increasing order. Print a single space between consecutive numbers.

Sample Input | Sample Output |

1 |
1 |