#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define mod 1000000007;

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

ll N;
set<string> key;

ll getDivisor(ll n) {
	vector<ll> v;
	for (ll i = 1; i*i <= n; i++) {
		if (n % i == 0) {
			v.push_back(i);
			if (i != n / i) {  
				v.push_back(n / i);
			}
			string s = to_string(i)+to_string(n/i);
			key.insert(s);
			s = to_string(n / i) + to_string(i);
			key.insert(s);
		}
	}
	return key.size();
}

int main()
{
	cin >> N;
	string s = to_string(N);

	cout << getDivisor(N) << endl;
	
	return 0;
}