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 = 40000 + 50;
long long n, l, s[N], c[N], num, ans;
string ss;
int a[N];
int main() {
  cin >> n >> ss;
  l = ss.size();
  for (int i = 0; i < l; i++) {
    a[i + 1] = ss[i] - '0';
  }
  for (int i = 1; i <= l; i++) {
    s[i] = s[i - 1] + a[i];
    for (int j = 0; j < i; j++) {
      c[s[i] - s[j]]++;
      num++;
    }
  }
  if (n > 0) {
    for (int i = 1; i <= 40000; i++)
      if (n % i == 0 && n / i < 40000) ans += c[i] * c[n / i];
    cout << ans << endl;
  } else
    cout << (2 * c[0] * num) - c[0] * c[0] << endl;
  return 0;
}
