#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int mod = 1e9+7;

ll N;
ll ans;
set<string> s;
int main(){
    cin>>N;
    for(ll i=1;i*i<=N;i++){
        if(N%i==0){
            string a = to_string(i);
            string b = to_string(N/i);
            s.insert(a + b);
            s.insert(b + a);
        }
    }
    p(s.size());

    return 0;
}