// tested by Hightail - https://github.com/dj3500/hightail
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;

long n;

void main() {
    scan(n);

    auto made = new string[](0);

    for (long i = 1; i*i <= n; i++) {
        if (n % i == 0) {
            long j = n / i;
            made ~= i.to!string ~ j.to!string;
            made ~= j.to!string ~ i.to!string;
        }
    }

    debug {
        writeln("made:", made);
    }

    auto ans = made.sort().uniq().array.length.to!long;

    writeln(ans);
}


void scan(T...)(ref T args) {
    string[] 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);
        }
    }
}