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 solve() {
  long long a;
  string s;
  cin >> a >> s;
  vector<long long> v;
  v.push_back(0);
  for (auto x : s) {
    v.push_back(v.back() + x - '0');
  }
  map<long long, long long> mp;
  long long ans = 0;
  for (long long i = 1; i < v.size(); i++)
    for (long long j = i; j < v.size(); j++) {
      mp[v[j] - v[i - 1]]++;
    }
  if (a == 0) {
    cout << s.size() * (s.size() + 1) * mp[0] - mp[0] * mp[0] << '\n';
    return;
  }
  for (long long i = 1; i < v.size(); i++)
    for (long long j = i; j < v.size(); j++) {
      if ((v[j] - v[i - 1]) and a % (v[j] - v[i - 1]) == 0) {
        ans += mp[a / (v[j] - v[i - 1])];
      }
    }
  cout << ans << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  long long t = 1;
  while (t--) solve();
  return 0;
}
