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 this_sum[100000], wait_sum[100000];
int main() {
  int a;
  cin >> a;
  string s;
  cin >> s;
  int len = s.size();
  for (int i = 0; i < len; i++) {
    int sum = 0;
    for (int j = i; j < len; j++) {
      sum += s[j] - '0';
      if (sum == 0) {
        this_sum[sum]++;
      } else if (a % sum == 0) {
        if (sum <= a / sum) this_sum[sum]++;
        if (sum >= a / sum) wait_sum[a / sum]++;
      }
    }
  }
  if (a == 0) {
    cout << this_sum[0] * (len * (len + 1) - this_sum[0]) << endl;
  } else {
    long long sum = 0;
    int limit = (int)sqrt(a + 0.5);
    for (int i = 1; i <= limit; i++)
      sum += this_sum[i] * wait_sum[i] * (1 + (i * i != a));
    cout << sum << endl;
  }
  return 0;
}
