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 a, i, j, ans = 0, n, arr[4100], find[50000] = {}, sum = 0;
  string s;
  cin >> a >> s;
  n = s.size();
  for (i = 0; i < n; i++) arr[i] = s[i] - '0';
  for (i = 0; i < n; i++) {
    sum = 0;
    for (j = i; j < n; j++) {
      sum += arr[j];
      find[sum]++;
    }
  }
  if (a == 0)
    ans = n * (n + 1) * find[0] - find[0] * find[0];
  else {
    for (i = 0; i < n; i++) {
      sum = 0;
      for (j = i; j < n; j++) {
        sum += arr[j];
        if (sum != 0 && a % sum == 0 && a / sum <= n * 9) ans += find[a / sum];
      }
    }
  }
  cout << ans << endl;
  return 0;
}
