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 main() {
  string s;
  long long a;
  cin >> a;
  cin >> s;
  int len = s.size();
  long long res = 0;
  int m1[36005] = {0};
  for (int i = 0; i < len; i++) {
    int ss = 0;
    for (int j = 1; i + j - 1 < len; j++) {
      ss += s[i + j - 1] - '0';
      m1[ss]++;
    }
  }
  for (int i = 1; i <= 36000; i++) {
    if (a % i) continue;
    if (a / i > 36000) continue;
    res = res + (long long int)m1[i] * m1[a / i];
  }
  if (a == 0) {
    res = (long long)m1[0] * len * (len + 1) - pow(m1[0], 2);
  }
  cout << res << endl;
  return 0;
}
