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 emer[10];
vector<int> divd;
bool ok(int i) {
  while (i) {
    int tt = i % 10;
    if (emer[tt]) return true;
    i /= 10;
  }
  return false;
}
int main() {
  int ans, x;
  while (scanf("%d", &x) != EOF) {
    divd.clear();
    memset(emer, 0, sizeof(emer));
    int tx = x;
    while (tx) {
      int tt = tx % 10;
      emer[tt] = 1;
      tx = tx / 10;
    }
    ans = 0;
    for (int i = 1; i <= sqrt(x); i++) {
      if (x % i == 0) {
        if (i != x / i)
          divd.push_back(i), divd.push_back(x / i);
        else
          divd.push_back(i);
      }
    }
    for (int i = 0; i < divd.size(); i++) {
      if (ok(divd[i])) ans++;
    }
    printf("%d\n", ans);
  }
  return 0;
}
