#include <stdio.h>
#include <algorithm>
#include <vector>
#include <deque>
#include <string>
#include <iostream>
using namespace std;
using ll = long long;

void solve();
int main() {
	solve();
#ifdef DBG
	while (true);
#endif
}

//537
void solve() {
	ll n, a, b;
	scanf("%lld", &n);

	vector<ll> e;
	for (ll i = 1; i * i <= n; i++) {
		if (n % i)
			continue;
		a = i, b = n / i;
		while (b) {
			a *= 10;
			b /= 10;
		}
		e.push_back(a + n / i);

		a = n / i, b = i;
		while (b) {
			a *= 10;
			b /= 10;
		}
		e.push_back(a + i);
	}
	sort(e.begin(), e.end());
	e.erase(unique(e.begin(), e.end()), e.end());
	printf("%d\n", e.size());
}