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;
map<int, int> m;
vector<vector<long long> > ans;
vector<bool> visited(9, 0);
bool check(long long b) {
  while (b != 0) {
    if (visited[b % 10] == 1) return 1;
    b = b / 10;
  }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  long long n, b, count = 0;
  cin >> n;
  b = n;
  while (b != 0) {
    visited[b % 10] = 1;
    b = b / 10;
  }
  for (long long int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (check(i)) count++;
      if (n / i != i)
        if (check(n / i)) count++;
    }
  }
  cout << count;
  return 0;
}
