Taxes(分拆素数和)
Problem
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 n 1 + n 2 + … + n k = n n_1+n_2+…+n_k=n 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 n i ≥ 2 n_i≥2 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 n n ( 2 ≤ n ≤ 2 ⋅ 1 0 9 ) (2≤n≤2⋅10^9) (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
Code
// #include <iostream>
// #include <algorithm>
// #include <cstring>
// #include <sstream>//整型转字符串
// #include <stack>//栈
// #include <deque>//堆/优先队列
// #include <queue>//队列
// #include <map>//映射
// #include <unordered_map>//哈希表
// #include <vector>//容器,存数组的数,表数组的长度
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool prim(ll x)
{
for(ll i=2;i*i<=x;i++)
{
if(x%i==0) return 0;
}
return 1;
}
int main()
{
ll n;
cin>>n;
if(n==2) cout<<1<<endl;//偶数素数
//哥德巴赫猜想:任何一个大于二的偶数都可以分解为两个素数和
else if(!(n&1)) cout<<2<<endl;//偶数
else//奇数
{
if(prim(n)) cout<<1<<endl;//素数
else if(prim(n-2)) cout<<2<<endl;//21-2=19
else cout<<3<<endl;//27-2=25-2=23
}
return 0;
}