St Andrews Online Judge

Prime Factors of Factorial

By Kay Akashi

Time: 1000 ms
Memory: 256000 kB

The code judging system is only available during contests. Check out the github repo for test cases and solutions.

Please log in.

Problem Statement

You are given a positive integer nn. Your task is to find prime factors of n!n!. For example, if n=3n = 3, you are asked to find the prime factors of 3!=63! = 6 hence they are 22 and 33.

Note that, prime factors of nn are the numbers that can divide nn without no remainder and are prime numbers.

Also note that, n!n! is equal to the product of all numbers smaller than or equal to nn. For example, 5!=1×2×3×4×5=1205! = 1 × 2 × 3 × 4 × 5 = 120.

Constraints

1n1051 \leq n \leq 10^{5}.

Subtask 1 (20%)

1n<1001 \leq n \lt 100.

Subtask 2 (80%)

100n105100 \leq n \leq 10^{5}.

Input

The input consists of one number, nn.

Output

Output the prime factors of n!n! in a single line. Note that the prime factors should be arranged in an increasing order.

Examples

Input

3

Output

2 3

Input

1

Output