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>
#pragma comment(linker, "/STACK:500000000")
using namespace std;
bool used[10];
bool ok(long long a) {
  while (a > 0) {
    if (used[a % 10]) return true;
    a /= 10;
  }
  return false;
}
int main() {
  long long n;
  vector<long long> d;
  cin >> n;
  long long i;
  for (i = 1; i * i < n; i++) {
    if (n % i == 0) d.push_back(i), d.push_back(n / i);
  }
  if (i * i == n) d.push_back(i);
  while (n > 0) {
    used[n % 10] = 1;
    n /= 10;
  }
  int cnt = 0;
  for (int i = 0; i < d.size(); i++) cnt += ok(d[i]);
  cout << cnt;
}
