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;
int sum[4001];
long long hoge[36001];
int main() {
  int a;
  string s;
  cin >> a >> s;
  int n = s.size();
  for (int i = 0; i < n; i++) sum[i + 1] = sum[i] + (s[i] - '0');
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < i; j++) {
      hoge[sum[i] - sum[j]]++;
    }
  }
  long long ans = 0;
  if (a == 0) {
    cout << hoge[0] * n * (n + 1) - hoge[0] * hoge[0];
    return 0;
  }
  for (int i = 1; i <= sum[n]; i++) {
    if (a % i != 0) continue;
    if (a / i > sum[n]) continue;
    ans += hoge[i] * hoge[a / i];
  }
  cout << ans;
  return 0;
}
