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;
vector<int> sum;
long long g[36001] = {0};
int main() {
  int a;
  cin >> a;
  char s[4100];
  cin >> s;
  int n = strlen(s), ms = 0;
  for (int i = 0; i < n; i++) {
    int c = 0;
    for (int j = i; j < n; j++) {
      c += s[j] - '0';
      sum.push_back(c);
      g[c]++;
    }
    if (c > ms) ms = c;
  }
  n = sum.size();
  long long res = 0;
  for (int i = 0; i < n; i++) {
    if (a && sum[i]) {
      if (a % sum[i] == 0 && a / sum[i] <= ms) res += g[a / sum[i]];
    }
    if (a == 0) {
      if (sum[i])
        res += g[0];
      else
        res += n;
    }
  }
  cout << res << endl;
}
