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;
map<long long, long long> mapa;
int main() {
  int i, j;
  int a;
  int limite;
  char s[10000];
  scanf("%d", &a);
  scanf("%s", s);
  int tudo = 0;
  for (i = 0; s[i] != '\0'; i++) {
    int soma = 0;
    for (j = i; s[j] != '\0'; j++) {
      soma += s[j] - '0';
      mapa[soma]++;
      tudo++;
    }
  }
  long long total = 0;
  map<long long, long long>::iterator iter;
  long long quantZeros = mapa[0];
  for (iter = mapa.begin(); iter != mapa.end(); iter++) {
    if (a != 0) {
      if (iter->first != 0 && a % iter->first == 0) {
        total += iter->second * mapa[a / iter->first];
      }
    } else {
      if (iter->first == 0) {
        total += iter->second * tudo;
      } else {
        total += iter->second * quantZeros;
      }
    }
  }
  printf("%I64d\n", total);
  return 0;
}
