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 size = 1000000;
long long d[1000000];
int main() {
  long long ans = 0, a, len;
  string s;
  cin >> a >> s;
  len = s.length();
  for (long long i = 0; i < size; i++) d[i] = 0;
  for (long long i = 0; i < len; i++) {
    long long sum = 0;
    for (long long j = i; j < len; j++) {
      sum += (int)(s[j] - '0');
      d[sum]++;
    }
  }
  if (a == 0) {
    for (long long i = 1; i < size; i++) ans += d[0] * d[i];
    ans *= 2;
    ans += d[0] * d[0];
    cout << ans;
    return 0;
  }
  for (long long i = 1; i <= size; i++)
    if ((a % i == 0) && (a / i > 0) && (a / i < size)) {
      ans += d[i] * d[a / i];
    }
  cout << ans;
  return 0;
}
