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;
int main() {
  long long int a;
  cin >> a;
  string S;
  cin >> S;
  int sz = S.length();
  vector<long long int> count_sum(36001, 0);
  for (int i = 0; i < sz; ++i) {
    int prev_sum = 0;
    for (int j = i; j < sz; ++j) {
      prev_sum += (S[j] - '0');
      count_sum[prev_sum]++;
    }
  }
  long long int ans = 0;
  if (a == 0) {
    ans = (count_sum[0] * sz * (sz + 1)) - (count_sum[0] * count_sum[0]);
  } else {
    for (long long int i = 1; i <= 36000; ++i) {
      if (a % i == 0 && a / i <= 36000) {
        ans += count_sum[i] * count_sum[a / i];
      }
    }
  }
  cout << ans;
  return 0;
}
