AtCoder Beginner Contest 180
C
Cream puff
AtCoder
⌀ 0
原题
← BD →
翻译中…

Problem Statement

翻译中…

We have $N$ cream puffs.

翻译中…

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

翻译中…

Constraints

翻译中…
  • $1 \leq N \leq 10^{12}$
  • $N$ is an integer.
翻译中…

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.

翻译中…

样例

Input #1
6
Output #1
1
2
3
6
For example, we can evenly distribute the cream puffs to two people by giving three to each person.
Input #2
720
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
Input #3
1000000007
Output #3
1
1000000007
题目信息
题号
abc180_c
时间限制
2 s
内存限制
1024 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。