Divisors I

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem Statement

Given positive integer n, print every positive divisor d for which n mod d equals zero, one per line, in increasing order.

Input

One positive integer n.

Output

Print each positive divisor of n on its own line in ascending order.

Subtasks

• Subtask 1 (20%): $1\le n\le30$.
• Subtask 2 (30%): $1\le n\le1000$.
• Subtask 3 (50%): $1\le n\le10000$.

Examples

Example 1

Input

6

Output

1
2
3
6

Explanation

The positive divisors of 6 are 1,2,3,6 in ascending order.

Example 2

Input

1

Output

1

Explanation

The number one is its own positive divisor.