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 f(int m) {
  bool vis[15];
  memset(vis, 0, sizeof(vis));
  int tmp = n;
  while (tmp != 0) {
    int c = tmp % 10;
    tmp /= 10;
    vis[c] = 1;
  }
  tmp = m;
  while (tmp != 0) {
    int c = tmp % 10;
    tmp /= 10;
    if (vis[c] == 1) return 1;
  }
  return 0;
}
int main() {
  int ret = 0;
  scanf("%d", &n);
  for (int i = 1; i * i <= n; i++) {
    if (n % i != 0) continue;
    if (f(i) == 1) ret++;
    if (f(n / i) == 1 && i != n / i) ret++;
  }
  printf("%d\n", ret);
}
