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;
using namespace std;
const int INF = int(1e9) * 2, mod = 1e9 + 9, N = 4000 * 9 + 5;
const long long BIG = 1e17;
long long a, ret0, cnt[N], ans, cnto;
string s;
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> a >> s;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '0') {
      cnto++;
    }
  }
  for (int i = 0; i < s.size(); i++) {
    long long su = 0;
    for (int j = i; j < s.size(); j++) {
      su += s[j] - '0';
      cnt[su]++;
      ret0++;
    }
  }
  if (!a) {
    int t = s.size() * (s.size() + 1) / 2;
    cout << 1ll * t * t - 1ll * (t - cnt[0]) * (t - cnt[0]);
    return 0;
  }
  for (int i = 1; i * i <= a; i++) {
    if (a % i == 0) {
      if (i > s.size() * 9 || a / i > s.size() * 9) continue;
      ans += cnt[i] * 1ll * cnt[a / i];
      if (i != a / i) {
        ans += cnt[i] * 1ll * cnt[a / i];
      }
    }
  }
  cout << ans;
}
