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;
stringstream ss;
int d[10];
int same(long long a, long long b) {
  memset(d, 0, sizeof d);
  while (a) d[a % 10]++, a /= 10;
  while (b) {
    if (d[b % 10]) return 1;
    b /= 10;
  }
  return 0;
}
int main() {
  long long a, cnt = 0;
  cin >> a;
  for (int i = 1; i * i <= a; i++)
    if (a % i == 0) {
      if (same(a, i)) cnt++;
      if (a > i * i && same(a, a / i)) cnt++;
    }
  cout << cnt << endl;
  return 0;
}
