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;
template <typename item>
item abs(item i) {
  if (i < 0) i = -i;
  return i;
}
template <class typea>
typea POW(typea b, typea p) {
  typea res = 1;
  while (p) {
    if (p & 1) res *= b;
    b *= b;
    b %= 1000000009LL;
    res %= 1000000009LL;
    p /= 2;
  }
  return res;
}
int tc = 0;
map<long long int, long long int> mp;
long long int sum[4000 + 10];
int main() {
  long long int a;
  cin >> a;
  char s[4000 + 10];
  cin >> s + 1;
  long long int n = strlen(s + 1);
  for (long long int i = 1; i <= n; i++) sum[i] = sum[i - 1] + s[i] - '0';
  for (long long int i = 1; i <= n; i++) {
    for (long long int j = i; j <= n; j++) {
      long long int temp = sum[j] - sum[i - 1];
      mp[temp]++;
    }
  }
  long long int ans = 0;
  for (long long int i = 1; i <= n; i++) {
    for (long long int j = i; j <= n; j++) {
      long long int temp = sum[j] - sum[i - 1];
      if (temp == 0) {
        if (a == 0) {
          ans += (n * (n + 1)) / 2;
        }
        continue;
      }
      if (a % temp == 0) {
        temp = a / temp;
        if (mp.count(temp) == 1) {
          ans += mp[temp];
        }
      }
    }
  }
  cout << ans;
}
