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 a;
char str[4005];
unordered_map<int, int> cnt;
int main(int argc, const char* argv[]) {
  ios::sync_with_stdio(false);
  scanf("%d%s", &a, str);
  int sz = strlen(str);
  for (int i = 0; i < sz; ++i) {
    int sum = 0;
    for (int j = i; j < sz; ++j) {
      sum += str[j] - '0';
      cnt[sum]++;
    }
  }
  long long ans = 0;
  if (a) {
    for (auto it = cnt.begin(); it != cnt.end(); it++) {
      if (it->first > 0 and it->first <= a and a % it->first == 0)
        ans += 1ll * cnt[a / it->first] * it->second;
    }
  } else {
    ans = 1ll * cnt[0] * sz * (sz + 1) - 1ll * cnt[0] * cnt[0];
  }
  cout << ans << endl;
  return 0;
}
