Codeforces Round #382 (Div. 2) D. Taxes

D. Taxes

time limit per test

2 seconds

memory limit per test

256 megabytes

Mr. Funt now lives in a country with a very specific tax laws. The total income of mr. Funt during this year is equal to n (n ≥ 2) burles and the amount of tax he has to pay is calculated as the maximum divisor of n (not equal to n, of course). For example, if n = 6 then Funt has to pay 3 burles, while for n = 25 he needs to pay 5 and if n = 2 he pays only 1 burle.

As mr. Funt is a very opportunistic person he wants to cheat a bit. In particular, he wants to split the initial n in several parts n₁ + n₂ + ... + n_k = n (here k is arbitrary, even k = 1 is allowed) and pay the taxes for each part separately. He can't make some part equal to 1 because it will reveal him. So, the condition n_i ≥ 2 should hold for all i from 1 to k.

Ostap Bender wonders, how many money Funt has to pay (i.e. minimal) if he chooses and optimal way to split n in parts.

Input

The first line of the input contains a single integer n (2 ≤ n ≤ 2·10⁹) — the total year income of mr. Funt.

Output

Print one integer — minimum possible number of burles that mr. Funt has to pay as a tax.

Examples

Input

4

Output

2

Input

27

Outpu

3

思路：容易想到要尽量分成n个素数的和，由哥德巴赫猜想可做分类讨论。
1.n为素数，答案 1；
2.n为偶数，则任意一个大于2的偶数都可以写成两个素数的和，答案 2；
3.n-2为素数，答案 2；
4.其他，答案 3.         1 + 2（一个偶数）= 3

#include <queue>
#include <functional>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <assert.h>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define REPP(i,k,n) for(int i=k;i<=n;i++)
#define scan(d) scanf("%d",&d)
#define scann(n,m) scanf("%d%d",&n,&m)
#define mst(a,k)  memset(a,k,sizeof(a));
#define LL long long
#define eps 1e-8
#define INF 0x3f3f3f3f
#define inf ~0u
#define mod 1000000007
#define fre  freopen("input.txt","r",stdin)
#define fot  freopen("out.txt","r",stdout)
#define upmo(a,b) (((a)=((a)+(b))%mo)<0?(a)+=mo:(a))
using namespace std;
#define N 100005
inline int prime(int x)
{
   for(int i=2; i<=sqrt(x); i++){
      if(x%i == 0) return 0;
   }
   return 1;
}
int main()
{
  int n;
  cin>>n;
  if(prime(n))        cout<<1;
  else if(n % 2 == 0)      cout<<2;
  else if(prime(n-2)) cout<<2;
  else                cout<<3;
  return 0;
}