Problem9655--ABC180 —— C - Cream puff

9655: ABC180 —— C - Cream puff

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

Description

We have $N$ cream puffs.

Find all possible number of people to which we can evenly distribute the cream puffs without cutting them.

Input

Input is given from Standard Input in the following format:

```
$N$
```

Output

Print the numbers of people in ascending order, each in its own line.

Constraints

-   $1 \leq N \leq 10^{12}$
-   $N$ is an integer.

Sample 1 Input

6

Sample 1 Output

1
2
3
6
For example, we can evenly distribute the cream puffs to two people by giving three to each person.

Sample 2 Input

720

Sample 2 Output

1
2
3
4
5
6
8
9
10
12
15
16
18
20
24
30
36
40
45
48
60
72
80
90
120
144
180
240
360
720

Sample 3 Input

1000000007

Sample 3 Output

1
1000000007

Source/Category