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() {
  long long k, i, j, l;
  cin >> k;
  string s;
  cin >> s;
  unordered_map<long long, long long> mp;
  vector<long long> v;
  v.push_back(-1);
  long long sum[s.size() + 1];
  sum[0] = 0;
  for (i = 0; i < s.size(); i++) {
    v.push_back(s[i] - '0');
    sum[i + 1] = sum[i] + (int)s[i] - (int)'0';
  }
  set<long long> se;
  set<long long>::iterator it;
  long long ans = 0, tot = 0, rem = 0;
  for (i = 1; i < v.size(); i++) {
    for (j = i; j < v.size(); j++) {
      long long curr = sum[j] - sum[i - 1];
      se.insert(curr);
      tot++;
      if (curr) rem++;
      mp[curr]++;
    }
  }
  if (k == 0) {
    ans = mp[0] * tot + mp[0] * rem;
  } else {
    for (it = se.begin(); it != se.end(); it++) {
      if (*it != 0) {
        if (k % (*it) == 0 && (*it) != 0) ans += (mp[*it] * mp[k / (*it)]);
      }
    }
  }
  cout << ans << "\n";
  return 0;
}
