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;
set<long> x;
long n;
void timcs() {
  while (n > 0) {
    long z = n % 10;
    n = n / 10;
    x.insert(z);
  }
}
int check(long j) {
  int dem = 0;
  while (j > 0) {
    long z = j % 10;
    j = j / 10;
    if (x.count(z) == 1) return 1;
  }
  return 0;
}
int main() {
  long res = 0, m;
  cin >> n;
  m = n;
  timcs();
  for (long i = 1; i * i <= m; i++) {
    if (m % i == 0) {
      res += check(i);
      if (i * i != m) res += check((long)(m / i));
    }
  }
  cout << res;
  return 0;
}
