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;
long long int m, n, c, d, i, j, k, l, r, x, t, y, u, a[10], b;
vector<long long int> v, w;
set<long long int> s1;
string s, p, q;
map<long long int, pair<long long int, long long int> > mp;
map<long long int, long long int> mk;
int main() {
  cin >> n;
  k = n;
  while (k > 0) {
    a[k % 10]++;
    k /= 10;
  }
  for (i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      k = i;
      while (k > 0) {
        if (a[k % 10]) {
          c++;
          break;
        }
        k /= 10;
      }
      if (i * i != n) {
        k = n / i;
        while (k > 0) {
          if (a[k % 10]) {
            c++;
            break;
          }
          k /= 10;
        }
      }
    }
  }
  cout << c;
}
