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;
void inout() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
}
int main() {
  inout();
  long long a, n, i, ans = 0, j;
  string second;
  cin >> a >> second;
  n = second.size();
  vector<long long> x;
  map<long long, long long> make_pair;
  for (auto c : second) x.push_back(c - '0');
  partial_sum(x.begin(), x.end(), x.begin());
  x.insert(x.begin(), 0);
  for (i = 1; i <= n; i++)
    for (j = i; j <= n; j++) make_pair[x[j] - x[i - 1]]++;
  for (i = 1; i <= n; i++)
    for (j = i; j <= n; j++) {
      if (x[j] == x[i - 1]) {
        if (!a) ans += ((n * (n + 1)) / 2);
      } else if (a % (x[j] - x[i - 1]))
        continue;
      else
        ans += make_pair[a / (x[j] - x[i - 1])];
    }
  cout << ans;
  return 0;
}
