#abc180c. [abc180_c]Cream puff
[abc180_c]Cream puff
Problem Statement
We have cream puffs.
Find all possible number of people to which we can evenly distribute the cream puffs without cutting them.
Constraints
- is an integer.
Input
Input is given from Standard Input in the following format:
Output
Print the numbers of people in ascending order, each in its own line.
Sample Input 1
6
Sample Output 1
1
2
3
6
For example, we can evenly distribute the cream puffs to two people by giving three to each person.
Sample Input 2
720
Sample Output 2
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 Input 3
1000000007
Sample Output 3
1
1000000007