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;
deque<int> Main;
deque<int> I;
int N;
int rez = 0;
void putindeque(deque<int> &v, int);
bool isOk();
int main() {
  cin >> N;
  putindeque(Main, N);
  for (int K = 1; K <= int(pow(N, 0.5)); K++) {
    if (N % K == 0) {
      putindeque(I, K);
      if (isOk()) rez++;
      putindeque(I, N / K);
      if (isOk()) rez++;
    }
  }
  if (pow(N, 0.5) == int(pow(N, 0.5))) {
    putindeque(I, int(pow(N, 0.5)));
    if (isOk()) rez--;
  }
  cout << rez << endl;
  return 0;
}
void putindeque(deque<int> &v, int a) {
  v.clear();
  while (a > 0) {
    v.push_front(a % 10);
    a /= 10;
  }
}
bool isOk() {
  for (int i = 0; i < Main.size(); i++)
    for (int j = 0; j < I.size(); j++)
      if (Main[i] == I[j]) return 1;
  return 0;
}
