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;
int get(int x, int y) {
  vector<bool> a(10);
  while (x) {
    a[x % 10] = true;
    x /= 10;
  }
  bool flag = false;
  while (y) {
    flag |= a[y % 10];
    y /= 10;
  }
  return flag;
}
int main() {
  int n;
  cin >> n;
  set<int> st;
  for (int i = 1; i * i <= n; i++) {
    if (n % i) continue;
    st.insert(i);
    st.insert(n / i);
  }
  int ans = 0;
  for (auto v : st) ans += (get(v, n));
  cout << ans << '\n';
  return 0;
}
