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;
const long long maxn = 41111;
long long sum[4111], sum1, kol[411111];
char s[4111];
int main() {
  scanf("%I64d\n", &sum1);
  gets(s);
  long long n = strlen(s);
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + (s[i - 1] - '0');
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) kol[sum[j] - sum[i - 1]]++;
  long long ans = 0;
  if (sum1 == 0) {
    cout << kol[0] * n * (n + 1) - kol[0] * kol[0];
    cin >> n;
    return 0;
  }
  for (int i = 1; i < maxn; i++)
    if (sum1 % i == 0 && sum1 / i < maxn) ans += kol[i] * kol[sum1 / i];
  cout << ans << "\n";
  cin >> n;
  return 0;
}
