Problem: PolandBall 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 ≤ 103. 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.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long int myXOR(long long int x, long long int y) {
  return (x | y) & (~x | ~y);
}
long long int powerLL(long long int x, long long int n) {
  long long int result = 1;
  while (n) {
    if (n & 1) result = result * x % 1000000007;
    n = n / 2;
    x = x * x % 1000000007;
  }
  return result;
}
bool comp(long long int a, long long int b) { return a > b; }
bool prime[1000001];
void seive() {
  long long int p, i;
  for (i = 1; i < 1000001 + 1; i++) prime[i] = true;
  prime[1] = false;
  for (p = 2; p * p <= 1000001; p++) {
    if (prime[p] == true) {
      for (i = p * p; i <= 1000001; i += p) {
        prime[i] = false;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t, n, m, i, j, k, l, r, x, y, a, b, c, d, e, f, p, nl, np, q;
  string str, str1;
  cin >> n;
  seive();
  for (i = 1; i <= 1000; i++) {
    if (prime[i * n + 1] == false) {
      cout << i;
      return 0;
    }
  }
}