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;
const int MAX = int(1e3) + 10;
bool digits[10];
int N;
bool ok(long long x) {
  while (x) {
    if (digits[x % 10]) return true;
    x /= 10;
  }
  return false;
}
int main() {
  cin >> N;
  int m = N;
  while (m) {
    digits[m % 10] = true;
    m /= 10;
  }
  int ans = 0;
  for (long long d = 1; d * d <= N; d++)
    if (N % d == 0) {
      ans += ok(d);
      if (d * d != N) ans += ok(N / d);
    }
  cout << ans << endl;
  return 0;
}
