import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;


void main() {
    long N;
    scan(N);

    long[] n1divs;
    for (long i = 1; i*i <= N - 1; i++) {
        if ((N - 1) % i == 0) {
            n1divs ~= i;
            n1divs ~= (N - 1) / i;
        }
    }

    long ans = n1divs.sort().uniq.count.to!long - 1;

    long[] ndivs;

    for (long i = 1; i*i <= N; i++) {
        if (N % i == 0) {
            ndivs ~= i;
            ndivs ~= N / i;
        }
    }

    ndivs = ndivs.sort().uniq.array[1..$];

    foreach (d ; ndivs) {
        long M = N;
        while (M % d == 0) {
            M /= d;
        }
        if (M % d == 1) ans++;
    }

    writeln(ans);
}



void scan(T...)(ref T args) {
    auto line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x > arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x < arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

void yes(bool ok, string y = "Yes", string n = "No") {
    return writeln(ok ? y : n);
}
