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 maxn = ((int)5e5) + 5;
long long int sum[maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  string s;
  cin >> s;
  for (int i = 0; i < s.length(); i++) {
    long long int total = 0;
    for (int j = i; j < s.length(); j++) {
      total += s[j] - '0';
      sum[total]++;
    }
  }
  long long int ans = 0;
  if (n == 0) {
    ans = 2 * sum[0] * ((s.length()) * (s.length() + 1)) / 2 - sum[0] * sum[0];
  } else {
    for (int i = 1; i < maxn; i++) {
      if (n % i == 0 && (n / i) < maxn) {
        ans += sum[i] * sum[n / i];
      }
    }
  }
  cout << ans;
  return 0;
}
