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;
bool visited[10];
void solve(int n) {
  while (n != 0) {
    visited[n % 10] = 1;
    n /= 10;
  }
}
bool check(int y) {
  while (y != 0) {
    if (visited[y % 10]) {
      return 1;
    }
    y /= 10;
  }
  return 0;
}
int main() {
  int n, c = 0, k = 0;
  cin >> n;
  solve(n);
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      if (check(i)) {
        c++;
      }
      if (i * i != n) {
        if (check(n / i)) {
          c++;
        }
      }
    }
  }
  cout << c << endl;
  return 0;
}
