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;
char kalimat[4005];
long long jum[4005];
map<long long, long long> tampung;
int main() {
  long long n, i, j, len, hasil;
  scanf("%lld", &n);
  getchar();
  scanf("%s", kalimat);
  getchar();
  len = strlen(kalimat);
  jum[0] = 0;
  for (i = 0; i < len; i++) {
    jum[i + 1] = jum[i] + kalimat[i] - '0';
  }
  for (i = 0; i < len; i++) {
    for (j = i; j < len; j++) {
      tampung[jum[j + 1] - jum[i]]++;
    }
  }
  hasil = 0;
  for (auto k : tampung) {
    if (k.first == 0) {
      if (n == 0) {
        hasil += (2 * k.second * ((len * (len - 1) / 2) + len));
        hasil -= (k.second * k.second);
      }
    } else if (n % k.first == 0 && n != 0) {
      hasil += (k.second * tampung[n / k.first]);
    }
  }
  printf("%lld\n", hasil);
}
