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;
long long a, ans, i, j, col, b[36001], sum[36001], len, null;
string s;
map<long long, long long> c;
bool ok;
int main() {
  cin >> a;
  cin >> s;
  ans = 0;
  for (i = 0; i < s.size(); i++) b[++ans] = (s[i] - '0');
  for (i = 1; i <= ans; i++) sum[i] = sum[i - 1] + b[i];
  for (i = 1; i <= ans; i++)
    for (j = i; j <= ans; j++) {
      c[sum[j] - sum[i - 1]]++;
      if (sum[j] - sum[i - 1] == 0) null++;
      len++;
    }
  if (a == 0) {
    for (i = 1; i <= ans; i++)
      for (j = i; j <= ans; j++) {
        if ((sum[j] - sum[i - 1]) == 0)
          col += len;
        else if ((sum[j] - sum[i - 1]) != 0)
          col += null;
      }
  } else {
    for (i = 1; i <= ans; i++)
      for (j = i; j <= ans; j++)
        if (sum[j] - sum[i - 1] != 0 && (a % (sum[j] - sum[i - 1])) == 0)
          col = col + c[a / (sum[j] - sum[i - 1])];
  }
  cout << col;
}
