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;
long long int a[360009];
string s;
int main() {
  long long int n, m;
  cin >> m;
  cin >> s;
  n = s.size();
  long long int x, y, ans = 0, maxi = 0;
  long long int i, j;
  for (i = 0; i < n; i++) {
    x = 0;
    for (j = i; j < n; j++) {
      x += s[j] - '0';
      a[x]++;
      maxi = max(x, maxi);
    }
  }
  if (m == 0) {
    x = n * (n + 1) - a[0];
    ans = a[0] * x;
    cout << ans << endl;
    return 0;
  }
  ans = 0;
  for (i = 1; i <= maxi; i++) {
    if (m % i == 0 && (m / i) <= maxi) {
      ans += a[i] * a[m / i];
    }
  }
  cout << ans;
}
