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 long inf = 1000000000;
double Time() { return double(clock()) / double(CLOCKS_PER_SEC); }
const int N = 1000001, MAXN = 100000;
string s;
int a, n;
long long res = 0, t[N];
int main() {
  cin >> a >> s;
  n = s.length();
  for (int i = (int)1; i <= (int)n; i++) {
    long long sum = 0;
    for (int j = (int)i; j <= (int)n; j++) {
      sum += s[j - 1] - '0';
      t[sum]++;
    }
  }
  if (a == 0) {
    for (int i = (int)1; i <= (int)MAXN; i++) res += t[0] * t[i];
    res = res * 2;
    res += t[0] * t[0];
  } else {
    for (int i = (int)1; i <= (int)MAXN; i++) {
      if (a % i == 0) res += t[i] * (a / i > MAXN || a / i < 0 ? 0 : t[a / i]);
    }
  }
  cout << res;
  return 0;
}
