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;
const long long inf = (long long)1e15 + 10;
const int N = (int)1e6 + 10;
void solve() {
  long long a;
  string s;
  cin >> a >> s;
  unordered_map<long long, long long> mp;
  for (int i = 0; i < (int)s.size(); i++) {
    int curr = 0;
    for (int j = i; j < (int)s.size(); j++) {
      curr += (s[j] - '0');
      mp[curr]++;
    }
  }
  long long ans = 0;
  if (a == 0) {
    ans = mp[0] * (s.size() * (1 + s.size()) - mp[0]);
    printf("%lld\n", ans);
    return;
  }
  for (int i = 1; i * i <= a; i++) {
    if (a % i == 0) {
      ans += mp[i] * mp[a / i];
      if ((a / i) != i) {
        ans += mp[i] * mp[a / i];
      }
    }
  }
  printf("%lld\n", ans);
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
