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 k, n, a[10005];
map<long long, long long> mp;
string s;
int main() {
  cin >> k;
  cin >> s;
  s = "+" + s;
  n = s.size() - 1;
  for (int i = 1; i <= n; i++) {
    a[i] = s[i] - '0';
    if (i != 1) a[i] += a[i - 1];
  }
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) {
      mp[a[j] - a[i - 1]]++;
    }
  long long ans = 0;
  for (int i = 1; i <= n; i++)
    for (int j = i; j <= n; j++) {
      if (k == 0 && a[j] - a[i - 1] == 0) {
        ans += n * (n + 1) / 2;
        continue;
      }
      if (a[j] - a[i - 1] == 0) continue;
      if (k % (a[j] - a[i - 1]) == 0) ans += mp[k / (a[j] - a[i - 1])];
    }
  cout << ans << endl;
}
