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 uint32_t N = 36000;
uint64_t f[N + 1], p[N + 1];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  uint32_t a, z = 0;
  string s;
  cin >> a >> s;
  const size_t n = s.length();
  for (size_t i = 1; i <= n; ++i) p[i] = p[i - 1] + s[i - 1] - '0';
  for (size_t i = 0; i < n; ++i) {
    for (size_t j = i + 1; j <= n; ++j) {
      ++f[p[j] - p[i]];
    }
  }
  if (a) {
    uint64_t t = 0;
    for (size_t i = 1; i <= N; ++i) {
      if (a % i or a / i > N) continue;
      t += f[i] * f[a / i];
    }
    cout << t << endl;
  } else {
    cout << (n * (n + 1) - *f) * *f << endl;
  }
  return 0;
}
