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 N = (int)1e5 + 123;
const long long INF = (long long)1e18 + 123;
const int inf = (int)1e9 + 123;
const int MOD = (int)1e9 + 7;
int x, n, a[4001];
string s;
int pref[4001], cnt[1000000];
long long res;
int main() {
  cin >> x >> s;
  n = (int)(s.size());
  for (int i = 0; i < (int)(s.size()); i++) {
    a[i + 1] = s[i] - '0';
  }
  for (int i = 1; i <= n; i++) {
    pref[i] = pref[i - 1] + a[i];
  }
  long long tot = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j++) {
      if (pref[j] - pref[i - 1] < 1000000) tot++, cnt[pref[j] - pref[i - 1]]++;
    }
  }
  for (int len = 1; len <= n; len++) {
    for (int i = 1; i + len - 1 <= n; i++) {
      int rv = -1;
      if (pref[i + len - 1] - pref[i - 1] > 0) {
        if (x % (pref[i + len - 1] - pref[i - 1]) == 0 &&
            x / (pref[i + len - 1] - pref[i - 1]) <= 50000) {
          rv = x / (pref[i + len - 1] - pref[i - 1]);
          res += cnt[rv];
        }
      } else {
        if (x == 0) res += tot;
      }
    }
  }
  cout << res;
  return 0;
}
