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 = 1e5 + 2;
int cnt[maxn];
int main() {
  int a;
  cin >> a;
  string s;
  cin >> s;
  for (int i = 0; i < s.size(); i++) {
    int now = 0;
    for (int j = i; j < s.size(); j++) {
      now += s[j] - '0';
      cnt[now]++;
    }
  }
  long long ans = 0;
  if (a == 0) {
    ans = cnt[0] * 1LL * cnt[0];
    for (int i = 1; i <= 36000; i++) {
      ans += cnt[0] * 2LL * cnt[i];
    }
    cout << ans;
    return 0;
  }
  int to = (int)sqrt(1.0 * a);
  for (int i = 1; i <= to; i++) {
    if (a % i != 0 || a > i * 36000LL) continue;
    if (a == i * i) {
      ans += cnt[i] * 1LL * cnt[i];
    } else
      ans += cnt[i] * 2LL * cnt[a / i];
  }
  cout << ans;
  return 0;
}
