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;
long long k, a, i, j, n, num, ans, sum[10001];
string s;
long long p[100000];
int main() {
  cin >> a;
  cin >> s;
  for (i = 0; i < s.length(); i++) sum[i + 1] = sum[i] + s[i] - '0';
  n = s.length();
  for (i = 1; i <= n; i++)
    for (j = i; j <= n; j++) p[sum[j] - sum[i - 1]]++;
  if (a == 0) {
    cout << n * (n + 1) * p[0] - p[0] * p[0];
    return 0;
  };
  for (i = 1; i <= 40000; i++)
    if (p[i] && a % i == 0 && a / i <= 40000) ans += p[a / i] * p[i];
  cout << ans;
  return 0;
}
