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;
enum { INF = 1000000000, MAX = 2147483640, MIN = -1 };
int vis[20];
bool judge(int x) {
  bool ok = false;
  for (int i = x; i; i /= 10)
    if (vis[i % 10]) {
      ok = true;
      break;
    }
  return ok;
}
int main() {
  int n;
  cin >> n;
  for (int i = n; i; i /= 10) vis[i % 10] = 1;
  int cnt = 0;
  for (int i = 1; i * i <= n; i++)
    if (n % i == 0) cnt += judge(i) + (i * i < n && judge(n / i));
  cout << cnt << endl;
  return 0;
}
