Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

The following languages are only available languages for the problems from the contest

Unknown Language Round #4:

- Befunge

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

F. Prime factorization

time limit per test

2 secondsmemory limit per test

64 megabytesinput

standard inputoutput

standard outputYou are given an integer *n*. Output its prime factorization.

If *n* = *a*_{1}^{b1}*a*_{2}^{b2} ... *a*_{k}^{bk}, where *a*_{k} are prime numbers, the output of your program should look as follows: *a*_{1} *a*_{1} ... *a*_{1} *a*_{2} *a*_{2} ... *a*_{2} ... *a*_{k} *a*_{k} ... *a*_{k}, where factors are ordered in non-decreasing order, and each factor *a*_{i} is printed *b*_{i} times.

Input

The only line of input contains an integer *n* (2 ≤ *n* ≤ 250).

Output

Output the prime factorization of *n*, as described above.

Examples

Input

245

Output

5 7 7

Input

13

Output

13

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/18/2018 18:35:02 (d1).

Desktop version, switch to mobile version.

User lists

Name |
---|