//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;

struct Sieve {
    int n;
    vector<int> f, primes;
    Sieve(int n=1):n(n), f(n+1) {
        f[0] = f[1] = -1;
        for(int64_t i=2; i<=n; ++i) {
            if(f[i]) continue;
            primes.push_back(i);
            f[i] = i;
            for(int64_t j = i*i; j <= n; j += i) {
                if(!f[j]) f[j] = i;
            }
        }
    }
    //素数判定
    bool isPrime(int x) {return f[x] == x;}
    //素数判定(1つ用)(宣言はsqrt(x)のサイズで)
    bool isPrime1(int64_t x) {
        bool m = true;
        for(int z:primes) {
            if(!(x%z)) {
                m = false;
                break;
            }
        }
        return m;
    }
    //素数列挙
    vector<int > factorList(int x) {
        assert(x <= n);
        vector<int> res;
        while(x != 1) {
            res.emplace_back(f[x]);
            x /= f[x];
        }
        return res;
    }
    //素因数分解　pair(素数, 素因数の数)
    vector<pair<int, int> > factor(int x) {
        vector<int> fl = factorList(x);
        if(fl.size() == 0) return {};
        vector<pair<int, int> > res(1, pair<int, int>(fl[0], 0));
        for(int p : fl) {
            if(res.back().first == p) {
                ++res.back().second;
            } else {
                res.emplace_back(p, 1);
            }
        }
        return res;
    }
    //素数列挙(1つ用)(宣言はsqrt(x)のサイズで)
    vector<int64_t> factorList1(int64_t x) {
        vector<int64_t> vec;
        for(int z:primes) {
            while(!(x%z)) {
                vec.emplace_back(z);
                x /= z;
            }
        }
        if(x != 1) vec.emplace_back(x);
        return vec;
    }
    //素数列挙(1つ用)(宣言はsqrt(x)のサイズで)　pair(素数, 素因数の数)
    vector<pair<int64_t, int> > factor1(int64_t x) {
        vector<int64_t> vec = factorList1(x);
        vector<pair<int64_t, int> > vecc;
        for(vector<int64_t>::iterator itr = vec.begin(); itr != vec.end(); ++itr) {
            if(itr != vec.begin() && *itr == *(itr-1)) {
                (vecc.end()-1)->second++;
            } else {
                vecc.emplace_back(pair<int64_t, int>(*itr, 1));
            }
        }
        return vecc;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n;
    cin >> n;
    Sieve pp(sqrt(n));
    auto x = pp.factor1(n);
    vector<ll> divisions(1, 1);
    rep(i, x.size()) {
        int so = divisions.size();
        rep(k, x[i].second) {
            rep(j, so) {
                divisions.push_back(divisions[j+k*so] * x[i].first);
            }
        }
    }
    Sieve p(sqrt(n-1));
    x.clear();
    x = p.factor1(n-1);
    ll ans = 1;
    rep(i, x.size()) {
        ans *= x[i].second+1;
    }

    rep(i, divisions.size()) {
        if(!i) continue;
        ll hh = n;
        while(hh >= divisions[i]) {
            if(hh%divisions[i]) {
                hh %= divisions[i];
            } else {
                hh /= divisions[i];
            }
        }
        if(hh == 1) {
            ans++;
        }
    }



    cout << ans-1 << endl;
}

Measured memory_bytes: 12060