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 long long maxn = 1e7;
char s[4005];
map<long long, int> vis;
long long a, all = 0, ans = 0, sum[maxn], tot = 0;
int main() {
  scanf("%I64d", &a);
  scanf("%s", s + 1);
  long long len = strlen(s + 1);
  for (int i = 1; i <= len; i++) {
    ans = 0;
    for (int j = i; j <= len; j++) {
      ans += s[j] - '0';
      sum[++all] = ans;
      vis[sum[all]]++;
    }
  }
  for (long long i = 1; i <= all; i++) {
    if (sum[i] != 0) {
      if (a % sum[i] != 0) continue;
      tot += vis[a / sum[i]];
    } else {
      if (a != 0) continue;
      tot += len * (len - 1) / 2 + len;
    }
  }
  printf("%I64d", tot);
}
