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() {
  ios::sync_with_stdio(false);
  int a, c[4003] = {}, m[36004] = {};
  long long int z = 0;
  vector<int> b;
  string s;
  cin >> a >> s;
  for (int i = 0; i < s.length(); i++) c[i + 1] = c[i] + s[i] - '0';
  for (int i = 1; i * i <= a; i++)
    if (a % i == 0) b.push_back(i);
  for (int i = 1; i <= s.length(); i++)
    for (int j = 0; j < i; j++) m[c[i] - c[j]]++;
  for (int i : b) {
    if (i * i == a) {
      long long int d = m[i];
      z += d * d;
    } else {
      if (a / i < 36004) z += (long long int)m[i] * m[a / i] * 2;
    }
  }
  if (a == 0)
    z = (long long int)m[0] * s.length() * (s.length() + 1) -
        (long long int)m[0] * m[0];
  cout << z;
}
