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[] ans;
    for (long k = 2; k*k <= N; k++) {
        if (check(N, k)) {
            ans ~= k;
        }
    }

    for (long d = 1; d*d <= N; d++) {
        if ((N - 1) % d == 0) {
            auto k = (N - 1) / d;
            if (k*k > N) {
                ans ~= k;
            }
        }
    }

    ans = ans.sort().uniq.array;

    debug {
        writeln(ans);
    }

    auto m = ans.length.to!long + 1;
    writeln(m);
}

bool check(long N, long k) {
    if (N % k == 0) {
        return check(N / k, k);
    }
    return N % k == 1;
}


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);
}
