The Little Elephant loves numbers. 

He has a positive integer x. The Little Elephant wants to find the number of positive integers d, such that d is the divisor of x, and x and d have at least one common (the same) digit in their decimal representations. 

Help the Little Elephant to find the described number.

Input

A single line contains a single integer x (1 ≤ x ≤ 109).

Output

In a single line print an integer — the answer to the problem.

Examples

Input

1


Output

1


Input

10


Output

2
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T gcd(T a, T b) {
  while (b != 0) swap(b, a %= b);
  return a;
}
int cd(int n, int k) {
  vector<int> a(10), b(10);
  while (n) {
    ++a[n % 10];
    n /= 10;
  }
  while (k) {
    ++b[k % 10];
    k /= 10;
  }
  for (int i = 0; i < 10; ++i) {
    if (a[i] && b[i]) return 1;
  }
  return 0;
}
void solve(int n) {
  if (n == 1) {
    cout << 1;
    return;
  }
  int ans = 0;
  for (int i = 1; i * i <= n; ++i) {
    if (n % i == 0) {
      if (i == n / i) {
        ans += cd(n, i);
      } else {
        ans += cd(n, i);
        ans += cd(n, n / i);
      }
    }
  }
  cout << ans;
}
int main() {
  int n;
  cin >> n;
  solve(n);
}
