CodeForces 735D 哥德巴赫猜想

http://codeforces.com/problemset/problem/735/D

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 n1 + n2 + ... + nk = 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 ni ≥ 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·109) — 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

Output

3

题目大意：一个n要付的税是n的最大因子，若n为素数，付1就好了，求最少的付税数。(这个数你可以拆开成几个数的和)

思路：哥德巴赫猜想

因此我们考虑四种情况：(1)n为素数，直接输出1即可。(2)n为偶数，输出2即可。(这时候的偶数不包括2)(3)n是奇数但不是素数，这时候考虑一下n-2是不是素数，若n-2是素数，2也是素数，此时要输出2。(4)其他情况，输出3。(当时就坑到3上了，直接把奇数按照3输出了，后来想了一下，奇数=偶数+奇数，只有当偶数为2，且n-2为素数时，有优解2；其他情况下最优也只能划到3，即一个偶数贡献2、一个奇素数贡献1或三个质数贡献3)

#include<iostream>
#include<cstdio>
#include<stack>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<set>
#include<algorithm>
#include<iterator>
#define INF 0x3f3f3f3f
#define EPS 1e-10
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

bool prime(int n)
{
	if(n==2||n==3)
		return true;
	for(int i=2;i*i<=n;i++)
		if(n%i==0)
			return false;
	return true;
}

int main()
{
	int n;
	scanf("%d",&n);
	if(prime(n))
		printf("1\n");
	else if(n%2==0||prime(n-2))
		printf("2\n");
	else
		printf("3\n");
	return 0;
}