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;
int main(int argc, const char* argv[]) {
  string s1;
  long long a2;
  cin >> a2 >> s1;
  vector<long long> inp;
  for (int i = 0; i < s1.size(); i++) {
    int z = s1[i] - '0';
    inp.push_back(z);
  }
  unordered_map<long long, long long> um;
  vector<long long> psums;
  psums.push_back(0);
  for (int i = 0; i < inp.size(); i++) {
    long long t = psums.back() + inp[i];
    psums.push_back(t);
  }
  long long tot = 0;
  for (int i = 0; i < psums.size(); i++) {
    for (int j = i + 1; j < psums.size(); j++) {
      tot++;
      long long t = psums[j] - psums[i];
      if (um.count(t) > 0)
        um[t] = um[t] + 1;
      else
        um[t] = 1;
    }
  }
  long long sum = 0;
  for (int i = 0; i < psums.size(); i++) {
    for (int j = i + 1; j < psums.size(); j++) {
      long long t = psums[j] - psums[i];
      if (t != 0 && a2 % t == 0) {
        long long d = a2 / t;
        if (um.count(d) != 0) sum += um[d];
      } else if (t == 0) {
        if (a2 == 0) sum += tot;
      }
    }
  }
  cout << sum << endl;
  return 0;
}
