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 double PI = 3.1415926536;
long long a[4005], c[5000005];
int main() {
  long long n, ans = 0;
  string s;
  cin >> n >> s;
  for (int i = 1; i <= s.size(); i++) a[i] = (s[i - 1] - '0') + a[i - 1];
  for (int i = 1; i <= s.size(); i++)
    for (int j = i; j <= s.size(); j++) {
      int x = a[j] - a[i - 1];
      c[x]++;
    }
  if (!n)
    ans = c[0] * (s.size() * (s.size() + 1) - c[0]);
  else {
    for (int i = 1; i <= a[s.size()]; i++)
      if (n % i == 0)
        if (n / i <= a[s.size()]) ans += c[i] * c[n / i];
  }
  cout << ans << "\n";
  return 0;
}
