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;
bool common(int x, int y) {
  while (x) {
    int yy = y;
    while (yy) {
      if (yy % 10 == x % 10) return true;
      yy /= 10;
    }
    x /= 10;
  }
  return false;
}
int main() {
  int x;
  cin >> x;
  int cnt = 0;
  for (int i = 1; i <= sqrt(x); i++) {
    if (x % i == 0) {
      if (common(x, i)) cnt++;
      if (i == x / i) continue;
      if (common(x, x / i)) cnt++;
    }
  }
  cout << cnt << endl;
  cin >> x;
}
