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<int, long long> m;
int main() {
  long long a;
  long long sum;
  long long num0 = 0;
  long long ans = 0;
  char line[4010];
  long long num[4010];
  map<int, long long>::iterator it;
  map<int, long long>::iterator temp;
  cin >> a;
  scanf("%s", line);
  int len = strlen(line);
  for (int i = 0; i < len; i++) num[i] = line[i] - '0';
  for (int i = 0; i < len; i++) {
    sum = 0;
    for (int j = i; j < len; j++) {
      sum += num[j];
      if (sum && a % sum == 0) m[sum]++;
      if (sum == 0) num0++;
    }
  }
  if (a == 0) {
    long long count = 0;
    for (it = m.begin(); it != m.end(); it++) {
      count += it->second;
    }
    ans = num0 * num0 + count * 2 * num0;
  } else {
    for (it = m.begin(); it != m.end(); it++) {
      int f = it->first;
      temp = m.find(a / f);
      if (temp != m.end()) {
        ans += (it->second) * (temp->second);
      }
    }
  }
  cout << ans << endl;
  return 0;
}
