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;
const int inf = 1000000000;
const int MOD = 1000000007;
const double pi = 2 * acos(0.0);
const double eps = 1e-12;
int a[11], b[11];
bool check(int x, int y) {
  int len1, len2;
  len1 = len2 = 0;
  while (x) {
    a[++len1] = x % 10;
    x /= 10;
  }
  while (y) {
    b[++len2] = y % 10;
    y /= 10;
  }
  for (int i = 1; i <= len1; ++i)
    for (int j = 1; j <= len2; ++j)
      if (a[i] == b[j]) return true;
  return false;
}
int main() {
  int n;
  cin >> n;
  int ans = 0;
  for (int i = 1; i * i <= n; ++i)
    if (n % i == 0) {
      ans += check(n, i);
      if (i * i < n) ans += check(n, n / i);
    }
  cout << ans << endl;
}
