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 ok(int n, int m) {
  bool vis[11];
  memset(vis, 0, sizeof(vis));
  char nn[11], mm[11];
  sprintf(nn, "%d", n);
  for (int i = 0; nn[i]; i++) {
    vis[nn[i] - '0'] = true;
  }
  sprintf(mm, "%d", m);
  for (int i = 0; mm[i]; i++) {
    if (vis[mm[i] - '0']) return true;
  }
  return false;
}
int main() {
  int n;
  scanf("%d", &n);
  int ans = 0;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      if (ok(n, i)) ans++;
      if (i * i != n) {
        if (ok(n, n / i)) ans++;
      }
    }
  }
  printf("%d\n", ans);
  return 0;
}
