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 MSIZE = 100050;
const int MOD = 1000000007;
const int SIZE = 40110;
long long a;
map<long long, int> mm;
long long nr[MSIZE];
long long yi[MSIZE];
long long sum[SIZE];
int main() {
  string line;
  while (cin >> a) {
    mm.clear();
    cin >> line;
    sum[0] = 0;
    int r = 0;
    for (int i = 0; i < line.size(); i++) {
      sum[i + 1] = sum[i] + line[i] - '0';
      for (int j = 0; j <= i; j++) {
        long long tmp = sum[i + 1] - sum[j];
        if (!tmp || (tmp <= a && !(a % tmp))) {
          if (mm.find(tmp) == mm.end()) {
            mm[tmp] = ++r;
            nr[r] = 1;
            yi[r] = tmp;
          } else
            nr[mm[tmp]]++;
        }
      }
    }
    if (!a) {
      cout << line.size() * (line.size() + 1) * nr[mm[0]] -
                  nr[mm[0]] * nr[mm[0]]
           << endl;
      continue;
    }
    long long cnt = 0;
    for (int k = 1; k <= r; k++)
      for (int p = 1; p <= r; p++) {
        if (yi[k] * yi[p] == a) cnt += nr[k] * nr[p];
      }
    cout << cnt << endl;
  }
}
