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 int base = 1e9;
const int maxn = 80;
const int logn = 20;
const int inf = 2e9;
const int alpha = 26;
const int my_hash = 29;
const long long l_inf = 4e18;
const long long mod = 1e9 + 7;
const double pi = acos(-1.0);
const double eps = 1e-9;
long long a, n, ans = 0, zero = 0;
string s;
vector<long long> m;
map<long long, int> cnt;
int main() {
  ios_base::sync_with_stdio();
  cin >> a >> s;
  n = s.size();
  m.assign(n + 1, 0);
  for (int i = int(1); i <= int(n); i++) {
    m[i] = s[i - 1] - '0';
    m[i] += m[i - 1];
  }
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j++) {
      if (m[j] - m[i - 1] != 0 && a % (m[j] - m[i - 1]) == 0)
        cnt[m[j] - m[i - 1]]++;
      if (m[j] - m[i - 1] == 0) zero++;
    }
  }
  if (!a)
    ans = zero * 1ll * (n * n + n) - zero * 1ll * zero;
  else {
    map<long long, int>::iterator i = cnt.begin();
    while (i != cnt.end()) {
      long long x = (*i).first;
      ans += cnt[x] * 1ll * cnt[a / x];
      i++;
    }
  }
  cout << ans;
}
