Given is a positive integer N.

We will choose an integer K between 2 and N (inclusive), then we will repeat the operation below until N becomes less than K.

* Operation: if K divides N, replace N with N/K; otherwise, replace N with N-K.



In how many choices of K will N become 1 in the end?

Constraints

* 2 \leq N \leq 10^{12}
* N is an integer.

Input

Input is given from Standard Input in the following format:


N


Output

Print the number of choices of K in which N becomes 1 in the end.

Examples

Input

6


Output

3


Input

3141


Output

13


Input

314159265358


Output

9
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL calc(LL k,LL n)
{
	if(n<k) return n;
	else if(n%k==0) return calc(k,n/k);
	else return n%k;
}
int main(void)
{
	LL n; scanf("%lld",&n);
	LL x;
	x=n-1;
	LL res=0; 
	for(LL i=1;i*i<=x;i++)
	{
		if(x%i) continue;
		if(i>1) res++;
		if(i*i!=x) res++;
	}
	
	x=n;
	for(LL i=1;i*i<=x;i++)
	{
		if(x%i) continue;
		if(i>1)
		{
			if(calc(i,n)==1) res++;
		}
	}
	res++; 
	printf("%lld\n",res);
	return 0;
}