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 k, n, a[4010];
unsigned long long kq, s[4010], sl[36010] = {0};
void Mo_Dong() {
  freopen("matrix.inp", "r", stdin);
  freopen("matrix.out", "w", stdout);
}
void Nhap() {
  cin >> k;
  char c;
  n = 0;
  while (cin >> c) a[++n] = c - 48;
}
void Tao_Mang() {
  s[0] = 0;
  for (int i = 1; i <= n; i++) s[i] = s[i - 1] + a[i];
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) sl[s[j] - s[i - 1]]++;
}
void Chuan_Bi() {
  Tao_Mang();
  kq = 0;
}
unsigned long long sqr(unsigned long long x) { return x * x; }
void Xu_Li() {
  int t, x;
  if (k > 0) {
    for (int i = 1; i <= n; i++)
      for (int j = i; j <= n; j++)
        if (s[j] - s[i - 1] <= k) {
          if (s[j] - s[i - 1] > 0) {
            t = s[j] - s[i - 1];
            x = k / t;
            if (k % t == 0 && x <= s[n]) kq += sl[x];
          }
        } else
          break;
  } else
    kq = sl[0] * n * (n + 1) - sqr(sl[0]);
}
void Ghi_Kq() { cout << kq; }
int main() {
  Nhap();
  Chuan_Bi();
  Xu_Li();
  Ghi_Kq();
  return 0;
}
