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 vis[10];
bool check(int a, int b) {
  memset(vis, 0, sizeof(vis));
  while (a > 0) {
    vis[a % 10] = true;
    a /= 10;
  }
  while (b > 0) {
    if (vis[b % 10]) return true;
    b /= 10;
  }
  return false;
}
int main() {
  int x;
  cin >> x;
  int res = 0;
  for (int i = 1; i * i <= x; i++) {
    if (x % i != 0) continue;
    res += check(i, x);
    if (i * i != x) res += check(x / i, x);
  }
  cout << res << endl;
}
