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>
#define ll long long
using namespace std;
ll cal(ll k,ll n) {
    if(n<k) return n;
    if(n%k==0) return cal(k,n/k);
    return n%k;
}
int main() {
    //freopen("in.txt","r",stdin);
    ll n,m,ans=0;
    scanf("%lld",&n),m=n-1;
    for(ll i=1;i*i<=m;i++) {
        if(m%i==0) {
            ans++;
            if(i*i!=m) ans++;
        }
    }
    for(ll i=2;i*i<=n;i++) {
        if(n%i==0) {
            ans+=(cal(i,n)==1);
        }
    }
    printf("%lld\n",ans);
    return 0;
}