#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
vector<string> answers;
void yueshu(LL x) {
    for (LL i = 1; i <= x / i; ++i) {
        if (x % i == 0) {
            answers.push_back(to_string(i) + to_string(x / i));
            if (i != x / i)
                answers.push_back(to_string(x / i) + to_string(i));
        }
    }
}
int main() {
    LL n;
    cin >> n;
    yueshu(n);
    sort(answers.begin(), answers.end());
    answers.erase(unique(answers.begin(), answers.end()), answers.end());
    cout << answers.size() << endl;
    return 0;
}