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;
map<long long, long long> tedad;
int main() {
  long long a;
  string s;
  cin >> a;
  cin >> s;
  long long ans = 0;
  for (int i = 0; i < s.size(); i++) {
    for (int j = i, sum = 0; j < s.size(); j++) {
      sum += s[j] - 48;
      tedad[sum]++;
    }
  }
  if (!a) {
    ans += tedad[0] * s.size() * (s.size() + 1);
    ans -= pow(tedad[0], 2);
    cout << ans;
    return 0;
  }
  for (int i = 1; i * i < a + 1; i++) {
    if (a % i == 0) {
      ans += tedad[i] * tedad[a / i];
      if (i != a / i) ans += tedad[i] * tedad[a / i];
    }
  }
  cout << ans;
  return 0;
}
