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;
int vis[11];
void init(long long x) {
  long long w;
  memset(vis, 0, sizeof(vis));
  while (x != 0) {
    w = x % 10;
    vis[w] = 1;
    x = x / 10;
  }
}
int solve(long long x) {
  long long w;
  while (x != 0) {
    w = x % 10;
    if (vis[w]) return 1;
    x = x / 10;
  }
  return 0;
}
int main() {
  long long n;
  while (scanf("%lld", &n) != EOF) {
    int ans = 0;
    init(n);
    for (int i = 1; i <= sqrt(n); i++) {
      if (n % i == 0) {
        if (solve(i)) ans++;
        if ((n / i) != i && solve(n / i)) ans++;
      }
    }
    cout << ans << endl;
  }
}
