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 ans;
char s[4005];
long long psum[4005];
map<long long, int> mp;
int main() {
  long long a;
  scanf("%lld", &a);
  scanf("%s", s + 1);
  int N = strlen(s + 1);
  for (int i = 1; i <= N; i++) s[i] -= '0';
  for (int i = 1; i <= N; i++) {
    psum[i] = psum[i - 1] + s[i];
  }
  long long kk = 0;
  for (int i = 1; i <= N; i++) {
    for (int j = i; j <= N; j++) {
      mp[psum[j] - psum[i - 1]]++;
      kk++;
    }
  }
  for (int i = 1; i <= N; i++) {
    for (int j = i; j <= N; j++) {
      long long k = psum[j] - psum[i - 1];
      if (k == 0) {
        if (a == 0) ans += kk;
        continue;
      }
      if (a % k == 0) {
        long long b = a / k;
        if (mp.count(b)) ans += mp[b];
      }
    }
  }
  printf("%lld", ans);
}
