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;
int c[4100];
int s[4100];
int g[4100 * 4100];
string str;
int main() {
  int a;
  cin >> a;
  cin >> str;
  int len = str.length();
  for (int i = 0; str[i]; i++) c[i + 1] = str[i] - '0';
  for (int i = 1; i <= len; i++) {
    s[i] = s[i - 1] + (long long)c[i];
  }
  int sz = 0, sz1 = 0;
  for (int i = 0; i <= len; i++)
    for (int j = i + 1; j <= len; j++) g[sz++] = s[j] - s[i];
  sort(g, g + sz);
  sz1 = upper_bound(g, g + sz, 0) - lower_bound(g, g + sz, 0);
  long long ans = 0;
  for (int i = 0; i < sz; i++) {
    if (g[i] == 0) {
      if (a == 0) ans += sz;
      continue;
    }
    if (a % g[i] == 0) {
      if (a == 0) {
        ans += sz1;
        continue;
      }
      ans +=
          upper_bound(g, g + sz, a / g[i]) - lower_bound(g, g + sz, a / g[i]);
    }
  }
  cout << ans << endl;
  return 0;
}
