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 long long int mod = 1000000007;
const long long int N = 1e5 + 5;
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  string s;
  cin >> n >> s;
  unordered_map<long long int, long long int> f;
  for (long long int i = 0; i < (long long int)((s).size()); i++) {
    long long int tmp = 0;
    for (long long int j = i; j < (long long int)((s).size()); j++) {
      tmp += (s[j] - '0');
      f[tmp]++;
    }
  }
  long long int ans = 0;
  if (n) {
    for (long long int i = 1; i * i <= n; i++) {
      if (n % i) continue;
      if (i == n / i)
        ans += f[i] * f[i];
      else
        ans += 2LL * f[i] * f[n / i];
    }
  } else {
    long long int all = 0;
    for (auto to : f) {
      all += to.second;
    }
    all -= f[0];
    ans += f[0] * f[0];
    ans += 2LL * f[0] * all;
  }
  cout << ans << '\n';
}
