//2020年3月21日現在

#include<stdio.h>
#include<cmath>
#include<math.h>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<complex>
#include<queue>
#include<set>
#include<utility>
#include<iomanip>
#include<limits>
#include<thread>
#include<map>
#include<stack>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_set>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<tuple>
#include <cstdio>

using namespace std;

template <class... A>
void prints() { cout << "\n"; }
template <class... A>
void prints_rest() { cout << "\n"; }
template <class T, class... A>
void prints_rest(const T &first, const A &... rest) { cout << " " << first; prints_rest(rest...); }
template <class T, class... A>
void prints(const T &first, const A &... rest) { cout << first; prints_rest(rest...); }

namespace {
    // printElems(&a[0], &a[n]);　みたいな感じで使う。
    void printElems(const int* begin, const int* end)
    {
        for (const int* p = begin; p != end; ++p) {
            std::cout << *p << ' ';
        }
        std::cout << std::endl;
    }
}

#define rep(i,n) for(int i=0; i<n; i++)
#define rep1(i,n) for(int i=1; i<n+1; i++)
#define repr(i,n) for(int i=n-1; i>=0; i--)
#define repr1(i,n) for(int i=n; i>0; i--)
#define FOR(i,j,n) for(int i=j; i < n; i++)
#define souatari rep1(i,n-1)rep(j,i)
#define souatari1 for(int i=2; i<n+1; i++)rep1(j,i-1)
#define mp make_pair
#define F first
#define S second
#define elif else if

typedef long long ll;
typedef vector<int>  vi;
typedef vector<vi>  vvi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef array<int,3> arr3;
typedef long double D;


const ll llinf =  numeric_limits<ll>::max();
const ll _llinf = numeric_limits<ll>::lowest();
const int inf = numeric_limits<int>::max();
const int _inf = numeric_limits<int>::lowest();
const double dinf = numeric_limits<double>::infinity();
const ll MOD = 1000000007;
const ll BIG = 10000000000000000;

vll divisor(ll n)
{
	vll ret;
	for (ll i = 1; i * i <= n; i++)
	{
		if (n % i == 0)
		{
			ret.push_back(i);
			if (i * i != n)
				ret.push_back(n / i);
		}
	}
	sort(begin(ret), end(ret), greater<ll>());
	return (ret);
}

map<ll,ll> factorize(ll n)
{
	map<ll,ll> ret;
	for (ll i = 2; i * i <= n; i++)
	{
		while (n % i == 0)
		{
			ret[i]++;
			n/=i;
		}
	}
	if(n!=1) ret[n]++;
	return (ret);
}


int main(){
	ll n;
	cin >> n;

/*	vll nlist = divisor(n);
	rep(i,nlist.size()){
		if(nlist[i] == 1) continue;
		if(nlist[i] != 2){
			vll tmp = divisor(nlist[i]-1);
			rep(j,tmp.size()){
				if(tmp[j]!=1) ans.insert(tmp[j]);
			}
		}
/*		if(nlist[i] != n){
			vll tmp = divisor(nlist[i]+1);
			rep(j,tmp.size()){
				if(tmp[j]!=1) ans.insert(tmp[j]);
			}
		}

	}
*/

	if(n == 2){
		prints(1);
		return 0;
	}

	ll ans = 1;
	map<ll,ll> tmp = factorize(n-1);
	vll ntmp = divisor(n);





	for(auto itr = tmp.begin(); itr != tmp.end(); ++itr) {
        ll tmptmp = itr->second;
		ans*=(tmptmp+1);
    }
	ans-=1;
	for(ll tmptmp : ntmp) {
		if(tmptmp == 1) continue;
		ll ntmptmp = n;
		while(ntmptmp%tmptmp==0) ntmptmp/=tmptmp;
		if(ntmptmp%tmptmp == 1) ans++;
    }

	prints(ans);




	return 0;
}



Measured memory_bytes: 384