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 INF = 1 << 29;
const double EPS = 1e-8;
const double PI = acos(-1);
const int N = 50000;
int c[N];
int main() {
  int a;
  while (cin >> a) {
    string s;
    cin >> s;
    int n = s.size();
    memset(c, 0, sizeof(c));
    for (int i = 0; i < (int)n; ++i) {
      int sum = 0;
      for (int j = i; j < n; ++j) {
        sum += s[j] - '0';
        c[sum]++;
      }
    }
    long long ans = 0;
    for (int i = 1; i < N; ++i) {
      if (a % i == 0) {
        if (a / i < N) ans += (long long)c[i] * c[a / i];
      }
    }
    if (a == 0) {
      ans *= 2;
      ans += (long long)c[0] * c[0];
    }
    cout << ans << endl;
  }
}
