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 INF = 1000000007;
const int N = 4444;
string s;
long long sum;
long long M[54444], X, n;
long long ans;
int main() {
  scanf("%I64d\n", &X);
  getline(cin, s);
  n = s.size();
  for (int i = 0; i < n; i++) {
    sum = 0;
    for (int j = i; j < n; j++) {
      sum = sum + int(s[j]) - 48;
      M[sum]++;
    }
  }
  if (X > 0) {
    for (int i = 1; i * i <= X; i++)
      if ((X % i) == 0) {
        if (X / i >= 40000) continue;
        long long x = M[i], y = M[X / i];
        if (i * i == X)
          ans += x * x;
        else
          ans += x * y * 2;
      }
  } else {
    long long x = M[0], y = n * (n + 1) / 2 - x;
    ans = x * y * 2 + x * x;
  }
  cout << ans << endl;
}
