Description

Glaire and Nick play hide-and-seek. There are $10$ holes (numbered $0$ to $9$) arranged in a circle, and Nick is hiding in one of them. Glaire starts at hole $0$, enters hole $1$ on the first move, skips $1$ hole to enter hole $3$ on the second move, and on the $i$-th move, skips $i-1$ holes to enter the next hole, and so on. Glaire enters holes $1000$ times but still cannot find Nick. Write a program to calculate which holes Nick might be hiding in.

Input Format

None.

Output Format

Output the hole numbers where Nick might be hiding, in ascending order, one per line.

Sample

None

2
4
7
9