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;
string tostr(int a) {
  stringstream ss;
  ss << a;
  string s;
  ss >> s;
  return s;
}
bool chk(int x, int d) {
  string a, b;
  a = tostr(x);
  b = tostr(d);
  for (int i = 0; i < a.length(); ++i) {
    for (int j = 0; j < b.length(); ++j)
      if (a[i] == b[j]) return true;
  }
  return false;
}
int main() {
  int x;
  scanf("%d", &x);
  int cnt = 0;
  for (int i = 1; i * i <= x; ++i) {
    if (x % i == 0) {
      if (chk(x, i)) ++cnt;
      if (i * i != x && chk(x, x / i)) ++cnt;
    }
  }
  printf("%d\n", cnt);
  return 0;
}
