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;
namespace Work {
int n;
bool vis[10];
bool ck(int x) {
  while (x) {
    if (vis[x % 10]) return true;
    x /= 10;
  }
  return false;
}
void solve(FILE* fin, FILE* fout) {
  int ret = 0;
  fscanf(fin, "%d", &n);
  int t = n;
  memset(vis, false, sizeof(vis));
  while (t) {
    vis[t % 10] = true;
    t /= 10;
  }
  for (int i = 1; i * i <= n; i++)
    if (n % i == 0) {
      if (ck(i)) ret++;
      if (n / i > i && ck(n / i)) ret++;
    }
  fprintf(fout, "%d\n", ret);
  return;
}
}  // namespace Work
int main() {
  Work::solve(stdin, stdout);
  return 0;
}
