#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef vector<VI> VVI;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

string conv(ll x){
	string ret;
	while (x) {
		char c = (x % 10) + '0';
		ret = c + ret;
		x /= 10;
	}
	return ret;
}

int main() {
	ll x;
	cin >> x;
	set<string> st;
	for (ll a = 1; a * a <= x; a++){
		if (x % a != 0) continue;
		ll b = x/a;
		string sa = conv(a), sb = conv(b);
		st.insert(sa + sb);
		st.insert(sb + sa);
	}
	cout << st.size() << endl;


	return 0;
}