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_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int a;
  cin >> a;
  string s;
  cin >> s;
  long long int arr[s.length() + 1];
  for (int i = 0; i < s.length(); i++) {
    arr[i] = s[i] - '0';
  }
  for (int i = 1; i < s.length(); i++) {
    arr[i] += arr[i - 1];
  }
  vector<long long int> v;
  map<long long int, long long int> mapp;
  for (int i = 1; i <= s.length(); i++) {
    for (int j = i - 1; j < s.length(); j++) {
      if (j == i - 1) {
        v.push_back(arr[j]);
        mapp[arr[j]]++;
      } else {
        v.push_back(arr[j] - arr[j - i]);
        mapp[arr[j] - arr[j - i]]++;
      }
    }
  }
  long long int n = s.length();
  long long int ans = 0;
  for (long long int i = 1; (i * i) <= a; i++) {
    if ((a % i) == 0) {
      if (i != (a / i))
        ans += (2 * (mapp[i] * mapp[a / i]));
      else
        ans += ((mapp[i] * (mapp[i])));
    }
  }
  if (a == 0) {
    ans = mapp[0] * (n * n + n) - mapp[0] * mapp[0];
    cout << ans << "\n";
    return 0;
  }
  cout << ans << "\n";
  return 0;
}
