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;
bool check(long long n, long long pos) { return n & (1LL << pos); }
long long Set(long long n, long long pos) { return n = n | (1LL << pos); }
long long arr[4003];
string str;
map<long long, long long> mp;
int main() {
  long long i, j, k, l, m, n, o, r, q;
  long long testcase;
  long long input, flag, tag, ans;
  while (cin >> n >> str) {
    long long idx = 0;
    long long zero = 0;
    for (auto it : str) {
      arr[++idx] = (it - '0');
    }
    for (i = 1; i <= idx; i++) {
      long long sum = 0;
      for (j = i; j <= idx; j++) {
        sum += arr[j];
        mp[sum]++;
      }
    }
    if (n == 0) {
      zero = mp[0];
      ans = (zero * idx * (idx + 1)) - (zero * zero);
      printf("%lld\n", ans);
      continue;
    }
    ans = 0;
    for (i = 1; i <= idx; i++) {
      long long sum = 0;
      for (j = i; j <= idx; j++) {
        sum += arr[j];
        if (sum == 0) continue;
        if (n % sum) continue;
        m = (n / sum);
        ans += mp[m];
      }
    }
    printf("%lld\n", ans);
  }
}
