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 A, M, i, j, p[4004], ans;
unordered_map<long long, long long> c;
string s;
int main() {
  cin >> A >> s;
  M = s.size();
  for (i = 0; i < s.size(); i++) p[i + 1] = p[i] + s[i] - '0';
  for (i = 1; i <= M; i++) {
    for (j = 0; j < i; j++) c[p[i] - p[j]]++;
  }
  for (i = 1; i <= M; i++) {
    for (j = 0; j < i; j++) {
      long long x = p[i] - p[j];
      if (A == 0 && x == 0)
        ans += M * (M + 1) / 2;
      else if (A == 0)
        ans += c[0];
      else if (x != 0 && A % x == 0)
        ans += c[A / x];
    }
  }
  cout << ans;
  return 0;
}
