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 int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const long long int Inf = 1LL << 62;
int ar[Max];
unordered_map<int, int> cnt;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n, a;
  long long int ans = 0;
  string str;
  cin >> a >> str;
  n = str.size();
  for (int i = 0; i < n; i++) {
    ar[i + 1] = str[i] - '0';
  }
  for (int i = 1; i <= n; i++) {
    ar[i] += ar[i - 1];
  }
  vector<int> vec;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j++) {
      if (!cnt[ar[j] - ar[i - 1]]) {
        vec.push_back(ar[j] - ar[i - 1]);
      }
      cnt[ar[j] - ar[i - 1]] += 1;
    }
  }
  for (int val : vec) {
    if (!a && !val) {
      ans += 1LL * cnt[val] * (n * (n + 1) / 2);
      continue;
    }
    double lagbe = (double)a / val;
    if (lagbe != (int)lagbe) {
      continue;
    }
    if (cnt.find(lagbe) == cnt.end()) {
      continue;
    }
    ans += 1LL * cnt[val] * cnt[(int)lagbe];
  }
  cout << ans << endl;
  return 0;
}
