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;
long long int a[10000000], b[100];
bool used[1000000];
int main() {
  long long int n, ans = 0, len = 0;
  cin >> n;
  if (n == 1) {
    cout << 1;
    return 0;
  }
  for (int i = 2; i <= sqrt(n * 1.0); i++) {
    if (n % i == 0) {
      len++;
      a[len] = i;
      if (n / i != i) {
        len++;
        a[len] = n / i;
      }
    }
  }
  len++;
  a[len] = 1;
  len++;
  a[len] = n;
  int y = n;
  while (y > 0) {
    b[y % 10] = 1;
    y = y / 10;
  }
  for (int i = 1; i <= len; i++) {
    int x = a[i];
    while (x > 0) {
      int l = x % 10;
      if (b[l] == 1) {
        ans++;
        break;
      }
      x = x / 10;
    }
  }
  cout << ans;
  return 0;
}
