Codefroces 384 D.Taxes（哥德巴赫猜想，拆解一个数为尽量少的质数的和）

D. Taxes

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 3burles, 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 partsn₁ + 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

output

3

 

这道题。。。D题，应该很难的。但是发现并不是什么逻辑题，而是一个哥德巴赫猜想，就是把一个数字分解成质数，最少分几个。比如样例，4分为2+2,27分为17+3+7，当然质数本身就不用分了，直接输出1就行了。

哥德巴赫猜想，我百度了一下并没有理解到底是在干嘛。。。然后dalao给我一个公式，他说这就是哥德巴赫猜想。

大致就是：

1.判断是否为偶数，偶数中如果是2输出1，否则输出2。不为偶数则继续

2.判断这个数字n是不是质数，是质数输出1，否则继续

3.判断n-2是不是质数，是质数输出2，否则输出3

代码如下：

#include<stdio.h>
int prime[60000],prime_num;

void init()
{
	int i,j,vst[60005];
	prime[0] = 2;
	prime[1] = 3;
	prime_num = 2;
	for(i=5;i<=60000;i++)
	{
		if(!vst[i])
		{
			prime[prime_num++] = i;
			j = 2 * i;
			while(j <= 60000)
			{
				vst[j] = 1;
				j += i;
			}
		}
	}
}

int main()
{
	int n, i;
	int flag1 = 0, flag2 = 0;
	scanf("%d", &n);
	if(n % 2 == 0)
	{
		if(n == 2)
			printf("1\n");
		else
			printf("2\n");
	}
	else
	{
		init();
		for(i = 0; prime[i] * prime[i] <= n; i++)
		{
			if(n % prime[i] == 0)
			{
				flag1 = 1;
				break;
			}
		}
		if(flag1)
		{
			for(i = 0; prime[i] * prime[i] <= n - 2; i++)
			{
				if((n - 2) % prime[i] == 0)
				{
					flag2 = 1;
					break;
				}
			}
			if(!flag2)
				printf("2\n");
			else
				printf("3\n");
		}
		else
		{
			printf("1\n");
		}
	}
}