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 N, sz, ans;
bool used[2][10];
int main() {
  vector<int> V;
  scanf("%d", &N);
  int n = N;
  while (n) {
    used[0][n % 10] = true;
    n /= 10;
  }
  for (int i = 1; i * i <= N; i++)
    if (N % i == 0) {
      V.push_back(i);
      sz++;
    }
  for (int i = 0; i < sz; i++) {
    for (int j = 0; j < 10; j++) used[1][j] = false;
    int x = V[i];
    int y = x;
    while (x) {
      used[1][x % 10] = true;
      x /= 10;
    }
    for (int j = 0; j < 10; j++)
      if (used[0][j] == true && used[1][j] == true) {
        ans++;
        break;
      }
  }
  for (int i = 0; i < sz; i++) {
    for (int j = 0; j < 10; j++) used[1][j] = false;
    int x = N / V[i];
    int y = x;
    if (x * x == N) continue;
    while (x) {
      used[1][x % 10] = true;
      x /= 10;
    }
    for (int j = 0; j < 10; j++)
      if (used[0][j] == true && used[1][j] == true) {
        ans++;
        break;
      }
  }
  printf("%d\n", ans);
  return 0;
}
