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:1024000000,1024000000")
using namespace std;
const int N = 100010;
const int M = 1e9 + 0.5;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int pi = cos(-1.0);
const long long oo = 0x3f3f3f3f3f3f3f3fll;
int a, n;
char s[N];
map<int, int> h;
int sum[N];
int main() {
  scanf("%d%s", &a, s + 1);
  n = strlen(s + 1);
  for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + s[i] - '0';
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) {
      h[sum[j] - sum[i - 1]]++;
    }
  long long ret = 0;
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) {
      int t = sum[j] - sum[i - 1];
      if (t == 0) {
        if (a) continue;
        ret += (n + 1ll) * n / 2;
        continue;
      }
      if (a % t) continue;
      ret += h[a / t];
    }
  cout << ret << endl;
  return 0;
}
