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

int check(LL p)
{
	LL m=n;
	while(m%p==0) m/=p;
	return m%p==1;
}

int main()
{
	
	cin>>n;
	if(n==2)
	{
		cout<<1<<endl;
		return 0;
	}
	int ans=2;
	for(LL i=2;i*i<=n;i++)
	{
		if(n%i) continue;
		ans+=check(i);
		if(i*i!=n) ans+=check(n/i);
	}
	n--;
	for(LL i=2;i*i<=n;i++)
	{
		if(n%i) continue;
		ans+=2;
		if(i*i==n) ans--;
	}
	cout<<ans<<endl;
	return 0;
}