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;
void readInputData();
void run();
int main(int argc, char** argv) {
  ios_base::sync_with_stdio(false);
  readInputData();
  run();
  return 0;
}
int x;
bool used[10];
void readInputData() { cin >> x; }
bool isEq(int a, int b) {
  memset(used, false, sizeof(used));
  while (a > 0) {
    used[a % 10] = true;
    a /= 10;
  }
  while (b > 0) {
    if (used[b % 10]) return true;
    b /= 10;
  }
  return false;
}
void run() {
  int answer = 0;
  for (int d = 1; d <= (int)sqrt(x); d++) {
    if (x % d == 0) {
      answer += isEq(x, d);
      answer += isEq(x, x / d) && (d != x / d);
    }
  }
  cout << answer << endl;
}
