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 PI = 3.14159265358979323846;
const long long modo = 998244353;
const long long inf = 2e14;
const long long ms = (5e5) + 5;
int ar[5000] = {0};
map<int, int> mm;
int main() {
  int a;
  cin >> a;
  string st;
  cin.ignore();
  getline(cin, st);
  int n = st.length();
  int i;
  int j;
  for (i = 1; i <= n; i++) {
    ar[i] = st[i - 1] - 48;
    ar[i] += ar[i - 1];
  }
  int s;
  for (i = 1; i <= n; i++) {
    for (j = i; j <= n; j++) {
      s = ar[j] - ar[i - 1];
      mm[s] += 1;
    }
  }
  long long ans = 0;
  long long aa, b;
  long long tt = (n * (n + 1)) / 2;
  for (auto it : mm) {
    aa = it.first;
    b = it.second;
    if (!aa) {
      if (!a) ans += (tt * b);
      continue;
    }
    if (!(a % aa)) {
      aa = mm[a / aa];
      ans += (aa * b);
    }
  }
  cout << ans;
}
