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;
long long x, ans = 0;
int n, a[100100];
string s;
map<long long, long long> m;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> x >> s;
  n = s.size();
  for (int i = 0; i < n; i++) a[i] = s[i] - '0';
  for (int i = 0; i < n; i++) {
    long long t = 0;
    for (int j = i; j < n; j++) {
      t += a[j];
      m[t]++;
    }
  }
  for (auto i : m) {
    if (i.first == 0) {
      if (x == 0) {
        ans += i.second * n * (n + 1) - i.second * i.second;
      }
      continue;
    }
    if (x == 0) continue;
    if (x % i.first != 0 or m.count(x / i.first) == 0) continue;
    ans += i.second * m[x / i.first];
  }
  cout << ans;
}
