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;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int a, i;
  long long int ans = 0;
  string s;
  cin >> a >> s;
  long long int n = s.length();
  unordered_map<long long int, long long int> m;
  long long int pf[n + 1];
  pf[0] = 0;
  for (i = 1; i <= n; i++) pf[i] = pf[i - 1] + (s[i - 1] - '0');
  for (i = 1; i <= n; i++) {
    for (int j = 0; j < i; j++) m[pf[i] - pf[j]]++;
  }
  if (a == 0) {
    if (m.find(0) != m.end())
      ans += 2 * ((n * (n + 1) / 2) - m[0]) * m[0], ans += m[0] * m[0];
    cout << ans << "\n";
    return 0;
  }
  for (auto x : m) {
    if (x.first != 0 && a % x.first == 0) {
      i = a / x.first;
      if (m.find(i) != m.end()) ans += 1ll * x.second * m[i];
    }
  }
  cout << ans << "\n";
  return 0;
}
