Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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

The problem statement has recently been changed. View the changes.

×
A. PolandBall and Hypothesis

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPolandBall is a young, clever Ball. He is interested in prime numbers. He has stated a following hypothesis: "There exists such a positive integer *n* that for each positive integer *m* number *n*·*m* + 1 is a prime number".

Unfortunately, PolandBall is not experienced yet and doesn't know that his hypothesis is incorrect. Could you prove it wrong? Write a program that finds a counterexample for any *n*.

Input

The only number in the input is *n* (1 ≤ *n* ≤ 1000) — number from the PolandBall's hypothesis.

Output

Output such *m* that *n*·*m* + 1 is not a prime number. Your answer will be considered correct if you output any suitable *m* such that 1 ≤ *m* ≤ 10^{3}. It is guaranteed the the answer exists.

Examples

Input

3

Output

1

Input

4

Output

2

Note

A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself.

For the first sample testcase, 3·1 + 1 = 4. We can output 1.

In the second sample testcase, 4·1 + 1 = 5. We cannot output 1 because 5 is prime. However, *m* = 2 is okay since 4·2 + 1 = 9, which is not a prime number.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/13/2021 00:34:44 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|