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 long double pi = acos(-1.0);
const double EPS = 1E-9;
const int inf = (1e+9);
const int NMAX = 1e+5;
const int MOD = 1743;
int n, k, a;
string s;
int q[100100];
long long ans = 0;
int main() {
  cin >> a;
  cin >> s;
  n = (int)(s).size();
  for (int i = 0; i < (n); ++i) {
    int sum = 0;
    for (int j = (i); j <= (n - 1); ++j) {
      sum += s[j] - '0';
      q[sum]++;
    }
  }
  for (int i = 0; i < (n); ++i) {
    int sum = 0;
    for (int j = (i); j <= (n - 1); ++j) {
      sum += s[j] - '0';
      if (a == 0) {
        if (sum == 0)
          ans += n * (n + 1) / 2;
        else
          ans += q[0];
      } else {
        if (sum != 0 && (a % sum) == 0 & (a / sum < 100000)) ans += q[a / sum];
      }
    }
  }
  cout << ans;
}
