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;
const long long INF = 1e9 + 7;
const int N = 5e2 + 10;
int flag[10];
bool check(int x) {
  while (x) {
    if (flag[x % 10]) return true;
    x /= 10;
  }
  return false;
}
int main() {
  int n;
  cin >> n;
  int o = n;
  memset((flag), (0), sizeof(flag));
  while (o) {
    flag[o % 10] = 1;
    o /= 10;
  }
  int ans = 0;
  for (int i = 1; i * i <= n; i++) {
    if (n % i != 0) continue;
    if (check(i)) ans++;
    if (check(n / i) && i != n / i) ans++;
  }
  cout << ans << endl;
  return 0;
}
