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>
char s[4001];
int l;
long long a;
long long cnt[36001];
int main() {
  scanf("%lld %s", &a, s);
  l = strlen(s);
  for (int i = 0; i < l; i++) {
    int sum = 0;
    for (int j = i; j < l; j++) {
      sum += s[j] - '0';
      cnt[sum]++;
    }
  }
  long long res = 0;
  if (a == 0) {
    for (int i = 1; i <= 36000; i++) {
      res += cnt[i] * cnt[0] * 2;
    }
    res += cnt[0] * cnt[0];
    printf("%lld\n", res);
    return 0;
  }
  for (int i = 1; i <= 36000; i++)
    if (a % i == 0) {
      if (a / i <= 36000) res += cnt[i] * cnt[a / i];
    }
  printf("%lld\n", res);
  return 0;
}
