#include <math.h>
#include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;

int main() {
  long n, half, cnt;
  vector<string> array;
  cin >> n;
  half = (long)sqrt(n);
  cnt = 0;
  for (int i = 1; i <= half; i++) {
    if (n % i == 0) {
      array.push_back(to_string(i) + to_string(n / i));
      array.push_back(to_string(n / i) + to_string(i));
    }
  }
  std::sort(array.begin(), array.end());
  cnt = 0;
  set<string> ans;
  for (int i = 0; i < array.size(); i++) {
    ans.insert(array[i]);
  }
  cout << ans.size() << endl;
}