codeforces 735 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 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 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

题意：一个数n拆成k个数，sum=sum{ni}（除了ni本身的最大的因数），k可以等于1；

质数除本身的最大因数为1，把数拆成质数的个数就是解；

开始暴力有一组数错了，，感觉过程没有错 ……

说个数学知识：哥德巴赫猜想：

任何一个偶数都可以拆成两个质数的和；

任何一个奇数如果n-2为质数 那么这个奇数可以拆成两个质数的和，

否则就是可以拆成3个质数的和。

然后就容易懂了

code：

#include <iostream>
#include<cstdio>
using namespace std;
int Prime(int n)
{
    for(int i=2;i*i<=n;i++)
    {
        if(n%i==0)
            return 0;
    }
    return 1;
}
int main()
{
    int n,cnt;
    scanf("%d",&n);
    if(Prime(n))
        cnt=1;
    else if(!(n%2))
        cnt=2;
    else
    {
        if(Prime(n-2))
            cnt=2;
        else cnt=3;
    }
    printf("%d\n",cnt);
    return 0;
}