In Berland a money reform is being prepared. New coins are being introduced. After long economic calculations was decided that the most expensive coin should possess the denomination of exactly *n* Berland dollars. Also the following restriction has been introduced for comfort: the denomination of each coin should be divisible by the denomination of any cheaper coin. It is known that among all the possible variants the variant with the largest number of new coins will be chosen. Find this variant. Print in the order of decreasing of the coins' denominations.
The first and only line contains an integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">6</sup>) which represents the denomination of the most expensive coin.
n = int(input())  # read the most expensive coin's denomination

# create an empty list to store the denominations of the coins
denominations = []

# divide the most expensive coin's denomination by all the integers from 2 to its square root
for i in range(2, int(n ** 0.5) + 1):
    while n % i == 0:  # keep dividing the current coin's denomination by i as long as it is divisible
        denominations.append(n)  # add the current coin's denomination to the list
        n = n // i  # divide the current coin's denomination by i

# add the final coin (which may have a denomination less than the square root of the original coin)
denominations.append(n)

# sort the list of denominations in decreasing order and remove any duplicates
denominations = sorted(list(set(denominations)), reverse=True)

# print the denominations of the coins
print(*denominations)
