链接：https://codeforces.com/problemset/problem/735/D

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

Copy

4

output

Copy

2

input

Copy

27

output

Copy

3

题解：哥德巴赫猜想：任意一个大于2的偶数可以拆成两个素数的和，任意一个大于7的奇数可以拆成三个素数的和。

代码：

#include<bits/stdc++.h>
using namespace std;
long long n,t,g,k,l,o,s,r,ans,ss,max1=0;
bool f(long long n)
{
	k=sqrt(n);
    int flag=1;
    for(int i=2;i<=k;i++)
    {
    	if(n%i==0)
    	{
    		return false;
    	}
    }
    return true;
} 
int main()
{
    cin>>n;
    if(f(n)==1)
    cout<<1;
    else if(n%2==0||f(n-2)==1)
    cout<<2;
    else if(n%2==1&&n>7)
    cout<<3;
}