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;
void precompute(void) {}
bool pos(int x, int y) {
  int i, inX[16], inY[16];
  for (i = 0; i < 10; i++) {
    inX[i] = 0;
    inY[i] = 0;
  }
  while (x > 0) {
    inX[x % 10] = 1;
    x /= 10;
  }
  while (y > 0) {
    inY[y % 10] = 1;
    y /= 10;
  }
  bool ret = false;
  for (i = 0; i < 10; i++) {
    ret |= inX[i] & inY[i];
  }
  return ret;
}
int main() {
  int n, i, ans;
  precompute();
  while (scanf("%d", &n) != EOF) {
    ans = 0;
    for (i = 1; i * i <= n; i++) {
      if (n % i == 0) {
        if (pos(i, n)) ans++;
        if (i * i != n && pos(n, n / i)) ans++;
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}
