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>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
long long n, len, a[4123], ans;
long long x[37000], sum[10000];
int main() {
  string s;
  cin >> n >> s;
  len = s.size();
  for (int i = 0; i < len; i++) a[i] = int(s[i]) - 48;
  for (int i = 0; i < len; i++) {
    sum[i] = a[i];
    if (i != 0) sum[i] += sum[i - 1];
  }
  for (int i = 0; i < len; i++)
    for (int j = i; j < len; j++) {
      x[sum[j] - sum[i] + a[i]]++;
    }
  for (int i = 1; i <= len * 9; i++) {
    if (n % i == 0 && n / i <= len * 9) {
      ans += x[i] * x[n / i];
    }
  }
  if (n == 0) ans = x[0] * len * (len + 1) - x[0] * x[0];
  cout << ans;
  return 0;
}
