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
/*
h s, d't skp th si tll i's sved
 * ABC141 E
 * ABC145 D
 * ABC147 F
 * ABC174 F
*/
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
ll n;
cin>>n;
ll ans=0;
for(ll i=2;i<=sqrt(n);i++)
{
if(n%i==0)
{
ll k=n;
while(k%i==0)
{
k/=i;
}
if((k-1)%i==0)
{
ans++;
}
if(n/i!=i)
{
k=n;
while(k%(n/i)==0)
{
k/=(n/i);
}
if((k-1)%(n/i)==0)
{
ans++;
}
}
}
}
for(ll i=1;i<=sqrt(n-1);i++)
{
if((n-1)%i==0)
{
if(i!=1)
{
ans++;
}
if((n-1)/i!=i)
{
ans++;
}
}
}
cout<<ans+1<<endl;
}



/*
 * ||||


 */