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;
int n;
bool d[10];
int calc(int a) {
  int tmp = a;
  while (tmp > 0) {
    int mod = tmp % 10;
    if (d[mod]) {
      return 1;
    }
    tmp /= 10;
  }
  return 0;
}
int compute(int a) {
  int ret = 0;
  for (int i = 1; i * i <= a; ++i) {
    if (i * i == a && calc(i) == 1) {
      --ret;
    }
    if (a % i == 0) {
      ret += calc(i) + calc(a / i);
    }
  }
  return ret;
}
int main() {
  cin >> n;
  int tmp = n;
  while (tmp > 0) {
    int mod = tmp % 10;
    d[mod] = true;
    tmp /= 10;
  }
  cout << compute(n);
}
