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 M = 37000;
int main() {
  long long a;
  long long ans = 0;
  long long cnt[M];
  long long all[4003];
  string s;
  cin >> a;
  cin >> s;
  int n = s.length();
  all[0] = 0;
  memset(cnt, 0, sizeof(cnt));
  for (int i = 0; i < n; i++) {
    all[i + 1] = all[i] + s[i] - '0';
  }
  for (int i = 0; i < n; i++)
    for (int j = i + 1; j <= n; j++) cnt[all[j] - all[i]]++;
  for (int i = 1; i < M; i++)
    if (a % i == 0 && a / i < M) {
      ans += cnt[i] * cnt[a / i];
    }
  if (a == 0) {
    ans = ans * 2 + cnt[0] * cnt[0];
  }
  cout << ans << endl;
  return 0;
}
