#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb push_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001;
const int INF=1001001001;
const int mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b,ll c){if(a==b)out(c);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
vi sosuu(ll n){   //n以下の素数列挙
    vector<bool> b(n-1,true);
    for(ll i=2;i<=sqrt(n);i++){
        if(!b[i-2])continue;
        for(ll j=2;i*j<=n;j++)b[i*j-2]=false;
    }
    vi res;
    rep(i,n-1)if(b[i])res.pb(i+2);
    return res;
}
bool is_prime(ll n){
    if(n<=1)return false;
    REP(i,2,sqrt(n)+1)if(n%i==0)return false;
    return true;
}
vp bunkai(ll n){
    vp res;
    if(n<=1)return res;
    vi x=sosuu(sqrt(n)+1);
    for(ll i:x){
        if(n%i!=0)continue;
        ll k=0;
        while(n%i==0){
            k++;
            n/=i;
        }
        res.eb(i,k);
    }
    if(n!=1)res.eb(n,1);
    return res;
}
int main(){
    ll n;cin>>n;
    if(n==2)dame(1);
    ll ans=0;
    for(ll i=1;i<=sqrt(n-1);i++){
        if((n-1)%i==0)ans+=2;
        if(i*i==n-1)ans--;
    }
    for(ll i=2;i<=sqrt(n);i++){
        if(n%i)continue;
        ll a=i,b=n/i;
        ll t=n;
        while(t%a==0)t/=a;
        if(t%a==1)ans++;
        if(b!=a){
            ll t=n;
            while(t%b==0)t/=b;
            if(t%b==1)ans++;
        }
    }
    out(ans);
}


Measured memory_bytes: 256