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;
bool used[20];
int ans;
void judge(int k) {
  while (k) {
    if (used[k % 10]) {
      ans++;
      return;
    }
    k /= 10;
  }
  return;
}
int main(void) {
  int x;
  cin >> x;
  int n = x;
  while (n) {
    used[n % 10] = 1;
    n /= 10;
  }
  for (int i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      judge(i);
      if (x / i != i) judge(x / i);
    }
  }
  cout << ans;
  return 0;
}
