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 x;
bool dig[10];
inline bool is(int num) {
  while (num > 0) {
    if (dig[num % 10]) return true;
    num /= 10;
  }
  return false;
}
int main() {
  cin >> x;
  int n = x;
  memset(dig, 0, sizeof dig);
  while (n > 0) {
    dig[n % 10] = true;
    n /= 10;
  }
  int ans = 0;
  for (int i = 1; i <= sqrt(x); i++) {
    if (x % i != 0) continue;
    if (is(i)) ans++;
    if (i != x / i && is(x / i)) ans++;
  }
  cout << ans << endl;
  return 0;
}
