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())
if n== 1:
  print(1)
  exit()
answer = [n]
def factors(x):
  for i in range(2,x + 1):
    if x % i == 0:
      return x//i
  return 1
while True:
  n = factors(n)
  answer.append(n)
  if n == 1:
    break
print(*answer)