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;
int main() {
  ios_base::sync_with_stdio(false);
  int a = 0;
  cin >> a;
  string s;
  cin >> s;
  vector<int> sum(1);
  for (char c : s) sum.push_back(sum.back() + c - '0');
  vector<int> cnt(sum.back() + 1);
  for (int i = 0; i < sum.size(); ++i)
    for (int j = i + 1; j < sum.size(); ++j) ++cnt[sum[j] - sum[i]];
  long long ans = 0;
  for (int i = 0; i < cnt.size(); ++i)
    for (int j = 0; j < cnt.size(); ++j)
      if (i * j == a) ans += cnt[i] * 1LL * cnt[j];
  cout << ans << endl;
  return 0;
}
