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;
long double mypow(long double x, int st) {
  long double ans = 1;
  while (st) {
    if (st & 1) ans *= x;
    x *= x;
    st /= 2;
  }
  return ans;
}
long long t[100100];
int main() {
  long long k;
  string s;
  cin >> k >> s;
  int n = s.size();
  vector<int> v;
  for (char c : s) v.push_back(c - '0');
  for (int i = 0; i < n; i++) {
    long long s = 0;
    for (int j = i; j < n; j++) {
      s += v[j];
      t[s]++;
    }
  }
  long long ans = 0;
  long long nul = 0;
  for (int i = 1; i < 100000; i++) {
    nul += t[i];
    if (k == 0) continue;
    if (t[i] == 0) continue;
    if (k % i) continue;
    if (k / i > 100000) continue;
    if (t[k / i] == 0) continue;
    ans += t[i] * t[k / i];
  }
  if (k == 0) ans += (t[0] * nul) * 2 + t[0] * t[0];
  cout << ans;
}
