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;
long long m[111111];
int main() {
  int x;
  scanf("%d\n", &x);
  string s;
  cin >> s;
  int n = s.length();
  for (int i = 0; i < n; i++) {
    int z = 0;
    for (int j = i; j < n; j++) {
      z += s[j] - '0';
      m[z]++;
    }
  }
  long long ans = 0;
  if (x == 0) {
    long long ans = m[0] * m[0];
    for (int i = 1; i < 111111; i++) ans += m[0] * m[i] * 2;
    printf("%I64d", ans);
    return 0;
  }
  for (int i = 0; i < n; i++) {
    int z = 0;
    for (int j = i; j < n; j++) {
      z += s[j] - '0';
      if (z == 0) continue;
      if (x % z) continue;
      if (z * z == x) continue;
      if (x / z > 111111) continue;
      ans += m[x / z];
    }
  }
  if (sqrt(x) * sqrt(x) == x && m[(int)sqrt(x)] > 0)
    ans += m[(int)sqrt(x)] * m[(int)sqrt(x)];
  printf("%I64d", ans);
  return 0;
}
