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 same(int a, int x) {
  int cnt[10] = {0}, cnt2[10] = {0};
  while (a) {
    cnt[a % 10]++;
    a /= 10;
  }
  while (x) {
    cnt2[x % 10]++;
    x /= 10;
  }
  for (int i = 0; i < 10; i++)
    if (cnt[i] > 0 && cnt2[i] > 0) return 1;
  return 0;
}
int main() {
  int x;
  scanf("%d", &x);
  int cnt = 0;
  for (int i = 1; i * i <= x; i++) {
    if (x % i == 0) {
      int a = i, b = x / i;
      if (same(a, x)) cnt++;
      if (a != b)
        if (same(b, x)) cnt++;
    }
  }
  cout << cnt << endl;
  return 0;
}
