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 int maxn = 4005;
long long cnt[9 * maxn];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  int a;
  string second;
  cin >> a >> second;
  vector<int> v;
  for (auto i : second) v.push_back(i - '0');
  int n = v.size();
  for (int i = 0; i < n; ++i) {
    int tmp = 0;
    for (int j = i; j < n; ++j) {
      tmp += v[j];
      ++cnt[tmp];
    }
  }
  long long ans = 0;
  for (int i = 1; i * i <= a; ++i) {
    if (a % i) continue;
    if (a / i > 9 * maxn) continue;
    ans += (cnt[i] * cnt[a / i]);
    if (i != a / i) ans += (cnt[i] * cnt[a / i]);
  }
  if (a) return cout << ans, 0;
  ans = cnt[0] * cnt[0];
  for (int i = 1; i <= 9 * n; ++i) ans += (2 * cnt[0] * cnt[i]);
  cout << ans << endl;
  return 0;
}
