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 maxn = 4010;
char num[maxn];
long long a;
vector<int> ve;
int main() {
  scanf("%I64d", &a);
  scanf("%s", &num);
  int len = strlen(num), non_zero = 0, zero = 0;
  for (int i = 0; i < len; i++) {
    long long cot = 0;
    for (int j = i; j < len; j++) {
      cot += num[j] - '0';
      if (cot != 0 && a % cot == 0)
        ve.push_back(cot);
      else if (cot == 0 && a == 0)
        ve.push_back(cot);
    }
  }
  sort(ve.begin(), ve.end());
  long long ans = 0;
  int sz = ve.size();
  for (int i = 0; i < sz; i++) {
    if (ve[i] == 0)
      ans += len * (len + 1) / 2;
    else {
      int kk = a / ve[i];
      int id = lower_bound(ve.begin(), ve.end(), kk) - ve.begin();
      int tt = upper_bound(ve.begin(), ve.end(), kk) - ve.begin();
      if (ve[id] == kk) ans += tt - id;
    }
  }
  cout << ans << endl;
  return 0;
}
