#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>

#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define REP(i,a,n) for(int i = (a);i < (n);i++)
#define PI 3.14159265359
#define MOD 1000000007

using namespace std;

int main(){
    long long n,count = 1;
    cin >> n;
    vector<string> s;
    REP(i, 1, n/2+1){
        if(n%i == 0){
            s.push_back(to_string(i)+to_string(n/i));
            s.push_back(to_string(n/i)+to_string(i));
        }
    }
    sort(ALL(s));
    REP(i, 1, s.size()){
        if(s[i-1] != s[i])count++;
    }
    cout << count << endl;
    return 0;
}