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 int sum[4001][4001];
int cnt[36003];
char str[4001];
int main() {
  int a, n = 0;
  cin.sync_with_stdio(0);
  cin.tie(0);
  scanf("%d%s", &a, str + 1);
  for (int i = 1; str[i]; i++, n++)
    for (int j = i; str[j]; j++)
      sum[i][j] = sum[i][j - 1] + str[j] - '0', cnt[sum[i][j]]++;
  long long int ans = 0;
  if (a) {
    for (int x1 = 1; str[x1]; x1++)
      for (int x2 = x1; str[x2]; x2++)
        if (sum[x1][x2] and a % (sum[x1][x2]) == 0 and
            (a / sum[x1][x2]) <= 36000)
          ans += cnt[a / (sum[x1][x2])];
  } else {
    ans = 1ll * cnt[0] * (1ll * n) * (1ll * n + 1) - (1ll * cnt[0] * cnt[0]);
  }
  cout << ans;
  return 0;
}
