#include <bits/stdc++.h>
using namespace std;

int fp;
long long n;

vector<long long> g(long long a) {
	vector<long long> dr;
	for(long long i = 2; i * i <= a; ++i) {
		if(a % i == 0) {
			dr.push_back(i);
			if(a / i != i) dr.push_back(a / i);
		}
	}
	if(a > 1) dr.push_back(a);
	return dr;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n;
	fp = g(n - 1).size();
	vector<long long> v = g(n);
	for(long long i : v) {
		long long p = n;
		while(p % i == 0) {
			p /= i;
		}
		if(p % i == 1) ++fp;
	}
	cout << fp << endl;
	return 0;
}
