// F - Division or Substraction
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

//約数列挙
vector<ll> divisors(ll n){
	vector<ll> res;
	for(ll i=1; i*i<=n; ++i){
		if(n%i != 0) continue;
		res.push_back(i);
		if(i*i != n) res.push_back(n/i);
	}
	return res;
}

int main(){
	ll N; cin>>N;
	ll ans = divisors(N-1).size() - 1;
	for(ll k:divisors(N)){
		if(k == 1) continue;
		ll n = N;
		while(n%k == 0) n /= k;
		if(n%k == 1) ++ans;
	}
	cout<< ans <<endl;
}