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 N = 36009;
long long int arr[N];
map<long long int, long long int> sum;
int main() {
  long long int a, t = 0, ans = 0;
  string s;
  cin >> a >> s;
  int n = s.length();
  for (int i = 1; i <= n; i++) {
    arr[i] = arr[i - 1];
    arr[i] += (s[i - 1] - '0');
  }
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j++) {
      sum[arr[j] - arr[i - 1]]++;
      if (arr[j] - arr[i - 1]) t++;
    }
  }
  if (!a) {
    ans = 2 * t * sum[0] + sum[0] * sum[0];
    cout << ans << endl;
    return 0;
  }
  for (int i = 1; i * i <= a; i++) {
    if (a % i == 0) {
      int y = a / i;
      if (y != i && i < N && y < N)
        ans += (sum[i] * sum[y] * 2);
      else if (y == i)
        ans += (sum[i] * (sum[i] - 1) + sum[i]);
    }
  }
  cout << ans << endl;
  return 0;
}
