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 offset[] = {1, 0, -1, 0, 1};
const int MXN = 4e6 + 1;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int a;
  cin >> a;
  string s;
  cin >> s;
  long long int n = s.size();
  vector<long long int> sum(n + 1);
  for (long long int i = 0; i < n; i++) sum[i + 1] = sum[i] + (s[i] - '0');
  long long int ans = 0;
  unordered_map<long long int, long long int> pos;
  for (long long int i = 0; i < n; i++) {
    for (long long int j = i; j < n; j++) {
      long long int temp = sum[j + 1] - sum[i];
      pos[temp]++;
    }
  }
  for (auto itr = pos.begin(); itr != pos.end(); itr++) {
    if (itr->first && a % itr->first == 0) {
      long long int b = a / itr->first;
      if (b != 0)
        ans += (itr->second * pos[b]);
      else
        ans += 2 * itr->second * pos[b];
    }
  }
  if (a == 0) ans += pos[0] * pos[0];
  cout << ans << "\n";
  return 0;
}
