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;
long long a[10], b[10];
long long check(long long x) {
  long long i;
  i = x;
  while (i > 0) {
    if (a[i % 10] == 1) return 1;
    i /= 10;
  }
  return 0;
}
int main() {
  long long x, i, cnt;
  cin >> x;
  i = x;
  while (i > 0) {
    a[i % 10] = 1;
    i /= 10;
  }
  for (i = 1, cnt = 0; i * i <= x; i++)
    if (x % i == 0) {
      if (check(i)) cnt++;
      if (i * i != x)
        if (check(x / i)) cnt++;
    }
  cout << cnt;
}
