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 maxn = 150 + 10;
int mark[maxn];
bool check(int x) {
  bool Mark = false;
  while (x) {
    if (mark[x % 10] == true) Mark = true;
    x /= 10;
  }
  return Mark;
}
int main() {
  int n;
  cin >> n;
  int x = n;
  while (x) {
    mark[x % 10] = true;
    x /= 10;
  }
  int ans = 0;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      int d = i;
      if (check(d) == true) ans++;
      if (n / d != d) {
        d = n / d;
        if (check(d) == true) ans++;
      }
    }
  }
  cout << ans << endl;
}
