You have a string of decimal digits s. Let's define bij = si·sj. Find in matrix b the number of such rectangles that the sum bij for all cells (i, j) that are the elements of the rectangle equals a in each rectangle.

A rectangle in a matrix is a group of four integers (x, y, z, t) (x ≤ y, z ≤ t). The elements of the rectangle are all cells (i, j) such that x ≤ i ≤ y, z ≤ j ≤ t.

Input

The first line contains integer a (0 ≤ a ≤ 109), the second line contains a string of decimal integers s (1 ≤ |s| ≤ 4000).

Output

Print a single integer — the answer to a problem.

Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

Examples

Input

10
12345


Output

6


Input

16
439873893693495623498263984765


Output

40
#include <bits/stdc++.h>
using namespace std;
int sum[4005];
char star[4005];
int num[4005 * 9];
int target;
vector<int> nnn;
map<int, int> judge;
int main() {
  long long ans;
  while (scanf("%d", &target) != EOF) {
    judge.clear();
    nnn.clear();
    scanf("%s", star);
    int len = strlen(star);
    memset(sum, 0, sizeof(sum));
    memset(num, 0, sizeof(num));
    sum[0] = 0;
    for (int i = 1; i <= len; i++) {
      sum[i] = sum[i - 1] + (star[i - 1] - '0');
    }
    for (int i = 1; i <= len; i++) {
      for (int j = i; j <= len; j++) {
        int temp = sum[j] - sum[i - 1];
        num[temp]++;
        if (!judge.count(temp)) {
          nnn.push_back(temp);
          judge[temp] = 1;
        }
      }
    }
    ans = 0;
    if (target != 0) {
      for (int i = 1; i * i <= target; i++) {
        if (target % i || !judge.count(target / i) || !judge.count(i)) continue;
        long long temp = (long long)num[target / i] * (long long)num[i];
        if (i != target / i) temp *= (long long)2;
        ans += temp;
      }
    } else {
      for (int i = 0; i < nnn.size(); i++) {
        long long temp = (((long long)num[0] * (long long)num[nnn[i]]));
        if (nnn[i] != 0) temp *= (long long)2;
        ans += temp;
      }
    }
    cout << ans << endl;
  }
  return 0;
}
