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 int oo = (int)1e9;
const double eps = 1e-7;
int main() {
  int a;
  string s;
  cin >> a >> s;
  map<int, int> M;
  for (int i = 0; i < ((int)((s).size())); i++) {
    int sum = 0;
    for (int j = i; j < ((int)((s).size())); j++) sum += s[j] - '0', M[sum]++;
  }
  long long ans = 0;
  if (a == 0)
    ans = (long long)M[0] *
          ((long long)((int)((s).size())) * (((int)((s).size())) + 1) / 2);
  for (auto i : M)
    if (i.first && a % i.first == 0)
      ans += (long long)i.second * 1LL * M[a / i.first];
  cout << ans << endl;
}
