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 int N = (1 << 15) + 1;
const long long M = 1e9 + 7;
const double eps = 1e-6;
bool mark[N];
long long phi[N];
vector<long long> p = {2};
int main() {
  int n;
  cin >> n;
  vector<int> d;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      d.push_back(i);
      if (i * i != n) d.push_back(n / i);
    }
  }
  int ans = 0;
  string s = to_string(n);
  for (auto x : d) {
    string t = to_string(x);
    for (auto c : s) {
      if (t.find(c) != string::npos) {
        ans++;
        break;
      }
    }
  }
  cout << ans << "\n";
}
