Codeforces Round #382 (Div. 1) 736B Taxes 【哥德巴赫猜想】

题目传送门：点击打开链接

B. 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 ton (n ≥ 2) burles and the amount of tax he has to pay is calculated as the maximum divisor ofn (not equal to n, of course). For example, ifn = 6 then Funt has to pay 3 burles, while for n = 25 he needs to pay5 and if n = 2 he pays only1 burle.

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

Ostap Bender wonders, how many money Funt has to pay (i.e. minimal) if he chooses and optimal way to splitn 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

题意：一个人他收入为n，并且他要交税。他交的税为n的最大约数，但这个约数不能等于它本身。他为了减轻税款，把总收入n分为了k份。并按n1,n2.......nk单个交税。但nk不能等于1。问他最少交多少税。

思路：首先我们明确一点：当n是素数时。交的税最少，为1。所以我们要把n分解成素数的和。

这里要用到一个猜想：哥德巴赫猜想:::任意一个大于等于2的偶数都能拆解为两个素数的和。

有了这个结论，这题就十分简单了。

如果n为偶数的话。结果就是2。

如果n为奇数的话，先将其拆成    2+另一个奇数  如果另一个奇数是素数的话，则结果为2.如果不是，则结果为3.

#include<bits/stdc++.h>
using namespace std;
#define LL long long

int pd(LL num)
{
    for(int i=2;i<=(int)sqrt(num*1.0);i++)
    {
        if(num%i==0)
        {
            return 0;
        }
    }
    return 1;
}

LL num;
int main()
{
    while(~scanf("%lld",&num))
    {
        if(num==2)
        {
            printf("1\n");
        }
        else if(num%2==0&&num>2)
        {
            printf("2\n");
        }
        else
        {
            if(pd(num))
            {
                printf("1\n");
            }
            else
            {
                if(pd(num-2))
                {
                    printf("2\n");
                }
                else
                {
                    printf("3\n");
                }
            }
        }
    }
    return 0;
}