#include <bits/stdc++.h>

#define show(x) cout << #x << " = " << x << endl

using namespace std;
using ll = long long;
using pii = pair<int, int>;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz=" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = 1e9 + 7;

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 100;

int main()
{
    ll n;
    cin >> n;
    unordered_set<ll> cand;
    int num = 0;
    for (auto i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            if (i * i == n) {
                const ll key = i * pow(10, log10(i) + 1) + i;
                if (cand.find(key) == cand.end()) {
                    cand.insert(key);
                    num++;
                }
            } else {
                const ll key1 = (n / i) * pow(10, (ll)log10(i) + 1) + i;
                const ll key2 = (i)*pow(10, (ll)log10(n / i) + 1) + (n / i);
                if (cand.find(key1) == cand.end()) {
                    cand.insert(key1);
                    num++;
                }
                if (cand.find(key2) == cand.end()) {
                    cand.insert(key2);
                    num++;
                }
            }
        }
    }
    cout << num << endl;
    return 0;
}