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;
const int N = 111111;
const int INF = int(1e9), mod = (int)1e9 + 7;
bool check(int x, int y) {
  int fx[10], fy[10];
  memset(fx, 0, sizeof fx);
  memset(fy, 0, sizeof fy);
  while (x > 0) {
    fx[x % 10]++;
    x /= 10;
  }
  while (y > 0) {
    fy[y % 10]++;
    y /= 10;
  }
  for (int i = 0; i < 10; ++i)
    if (fx[i] > 0 && fy[i] > 0) return 1;
  return 0;
}
int main() {
  int x;
  cin >> x;
  int cnt = 0;
  for (int i = 1; i * i <= x; ++i) {
    if (x % i) continue;
    if (check(x, i)) cnt++;
    if (i * i != x && check(x, x / i)) cnt++;
  }
  cout << cnt;
  return 0;
}
