CodeForces - 735D Taxes （数论）

题目链接：http://codeforces.com/problemset/problem/735/D点击打开链接

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

一开始的时候想成从该数开始往下不断找素数贪心 但是wa了

举个反例

5616

贪心结果是

5591 23 2

但是可以拆成

5573 43

哥德巴赫猜想啊。。

于是可以分类判断

#include<bits/stdc++.h>
using namespace std;
bool isprime(int n) {
    if(n < 2)return false;
    for(int i = 2; i * i <= n; i++) {
        if(n % i == 0)return false;
    }
    return true;
}
int main() {
    int n;
    while(~scanf("%d", &n))
    {
        if(isprime(n))
            printf("1\n");
        else if(n % 2 == 0)
            printf("2\n");
        else if(isprime(n - 2))
            printf("2\n");
        else
            printf("3\n");
    }
}