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 mx = 4000 + 5;
const int mx1 = 36000;
bool vis[mx1];
map<int, long long int> mapa;
int main() {
  int i, j, k, n;
  long long int a;
  string s;
  cin >> a >> s;
  n = s.size();
  int sum;
  int nint = 0;
  for (i = 0; i < n; i++) {
    sum = 0;
    for (j = i; j < n; j++) {
      sum += s[j] - '0';
      if (mapa.count(sum) == 0)
        mapa[sum] = 1;
      else
        mapa[sum]++;
      nint++;
    }
  }
  long long int ans = 0;
  map<int, long long int>::iterator iti, itj;
  for (iti = mapa.begin(); iti != mapa.end(); iti++) {
    int suma = iti->first;
    if (suma != 0 && a % suma == 0) {
      int b = a / suma;
      if (mapa.count(b) != 0) {
        ans += mapa[suma] * mapa[b];
      }
    }
  }
  if (a == 0) ans = 2 * ans + mapa[0] * mapa[0];
  cout << ans << endl;
  return 0;
}
