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> sums;
long long f[4010];
int main() {
  ios::sync_with_stdio(false);
  long long a;
  cin >> a;
  string s;
  cin >> s;
  f[1] = s[0] - '0';
  for (int i = 2; i <= (int)((s).size()); i++) f[i] = f[i - 1] + s[i - 1] - '0';
  sums.clear();
  for (int i = 1; i <= (int)((s).size()); i++)
    for (int j = i; j <= (int)((s).size()); j++) sums[f[j] - f[i - 1]]++;
  long long ans = 0;
  for (map<long long, long long>::iterator it = sums.begin(); it != sums.end();
       it++) {
    if (it->first) {
      if (a % it->first == 0) ans += it->second * sums[a / it->first];
    } else if (a == 0)
      ans += (it->second * (int)((s).size()) * ((int)((s).size()) + 1)) / 2;
  }
  cout << ans << endl;
  return 0;
}
