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 = 4e4 + 4;
int cumSum[N];
map<int, int> visit;
int main() {
  int a;
  scanf("%d", &a);
  string s;
  cin >> s;
  int n = s.size();
  for (int i = 0; i < n; ++i) {
    cumSum[i + 1] += s[i] - '0' + cumSum[i];
    for (int j = 0; j <= i; ++j) {
      visit[cumSum[i + 1] - cumSum[j]]++;
    }
  }
  if (!a) {
    long long ans = n * 1ll * (n + 1) * visit[0];
    printf("%lld", ans - visit[0] * 1ll * visit[0]);
    return 0;
  }
  long long ans = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < i; ++j) {
      if (!(cumSum[i] - cumSum[j])) continue;
      int num = 0, mod = 0;
      if ((cumSum[i] - cumSum[j]))
        num = a / (cumSum[i] - cumSum[j]), mod = a % (cumSum[i] - cumSum[j]);
      if (!mod && visit[num]) {
        ans += visit[num];
      }
    }
  }
  printf("%lld", ans);
}
