import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N = lread();
    long ans;
    foreach (k0; 1 .. N + 1)
    {
        if (N < k0 * k0)
            break;
        if (N % k0 == 0)
        {
            if (k0 != 1)
            {
                long n = N;
                while (0 < n && n % k0 == 0)
                    n /= k0;
                if (0 < n && n % k0 == 1)
                {
                    // writeln(k0);
                    ans++;
                }
            }
            {
                long n = N;
                long k1 = n / k0;
                while (0 < n && n % k1 == 0)
                    n /= k1;
                if (0 < n && k1 != 1 && n % k1 == 1)
                {
                    // writeln(k1);
                    ans++;
                }
            }
        }
    }
    foreach (k0; 1 .. N + 1)
    {
        if (N < k0 * k0)
            break;
        if ((N - 1) % k0 == 0)
            ans += 2;
    }
    writeln(ans - 1);
}
