Print All Divisors of a Number
Find all divisors of a given number in O(sqrt(N)) time.
Input format
The first line contains X (1 ≤ X ≤ 10^9, distinct values including 1, primes, squares).
Output format
Print all divisors in ascending order.
Constraints
- Values fit in a 64-bit signed integer
- Trailing whitespace and a trailing newline are ignored by the judge
Read from stdin, write to stdout. Sample cases below show the exact format.
Sample cases
Example 1
Input
1Expected output
1Example 2
Input
2Expected output
1 2