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 n, ans, c1[100], c2[100];
void check(long a, long b) {
  for (int i = 0; i < 10; i++) c1[i] = c2[i] = 0;
  while (a) {
    c1[a % 10]++;
    a /= 10;
  }
  while (b) {
    c2[b % 10]++;
    b /= 10;
  }
  long fl = 0;
  for (int i = 0; i < 10; i++)
    if (c1[i] * c2[i]) fl = 1;
  if (fl) ++ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n;
  for (int i = 1; i * i <= n; i++)
    if (n % i == 0) {
      check(n, i);
      if (i * i != n) check(n, n / i);
    }
  cout << ans << endl;
  cin.get();
  cin.get();
  return 0;
}
