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>
#pragma GCC optimize("O3")
using namespace std;
template <class c>
struct rge {
  c b, e;
};
template <class c>
rge<c> range(c i, c j) {
  return rge<c>{i, j};
}
template <class c>
auto dud(c* x) -> decltype(cerr << *x, 0);
template <class c>
char dud(...);
struct debug {
  template <class c>
  debug& operator<<(const c&) {
    return *this;
  }
};
const long long maxn = 1e5 + 5;
vector<long long> cnt(maxn);
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long a;
  cin >> a;
  string s;
  cin >> s;
  long long n = s.length();
  for (long long i = 0; i < n; i++) {
    long long cur = 0;
    for (long long j = i; j < n; j++) {
      cur += (s[j] - '0');
      cnt[cur]++;
    }
  }
  long long ans = 0;
  for (long long i = 1; i < maxn; i++) {
    if (a % i != 0) continue;
    long long j = a / i;
    if (j >= maxn) continue;
    ans += (cnt[i] * cnt[j]);
  }
  if (a == 0) {
    ans *= 2;
    ans += cnt[0] * cnt[0];
  }
  cout << ans << "\n";
  return 0;
}
