Remainder 2

Source: beecrowd

Version: Phuoc Hung OJ Extended

Problem Statement

Given a positive integer n, print each i from 1 to 10000 with i mod n = 2, one per line. For n=1 or 2, print nothing.

Input

One integer n in [1,10000] (PHOJ Extended bound).

Output

One matching number per line, no output if none.

Subtasks

• Subtask 1 (20%): $1\le n\le10$.
• Subtask 2 (30%): $1\le n\le100$.
• Subtask 3 (50%): $1\le n\le10000$.

Examples

Example 1

Input

9999

Output

2

Explanation

Only 2 leaves remainder 2 when divided by 9999.

Example 2

Input

2

Output

Explanation

Remainder modulo 2 can only be 0 or 1, so there is no output.