Codefoces 735D Taxes（数学 哥德巴赫猜想）

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₁ + 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.

Example

Input

4

Output

2

Input

27

Output

3

题目大意：给你一个数字，可以分成几个数之和（不能分成1），让你求这几个数的最大约数（除了自身）的和。

要让这个和最小。

题目分析：如果这个数字是质数，那个很显然，这个数字不用分。答案是1；

        如果这个数字是偶数，那么根据哥德巴赫猜想，可以知道，这个可以分成两个质数，答案是2；

        如果这个数字可以分成一个质数和2的话，那么可以得到答案是2

        否则，这个数字就可以分成三个质数，答案是3；
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
bool prim(int n){
	for(int i=2;i*i<=n;i++){
		if(n%i == 0)
		  return false  ;
	}
	return true ;
}
int main(){
	int n,m;
	while((scanf("%d",&n))!=EOF){
		if(prim(n))
		 printf("1\n");
		else if(n%2 == 0)
		 printf("2\n");
		else if(prim(n-2))
		 printf("2\n");
		else printf("3\n");
	}
	return 0;
}