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;
string a;
long long k, ans, n;
map<long long, long long> mp;
int main() {
  cin >> k >> a;
  n = a.size();
  for (long long i = 0; i < n; i++) {
    long long sum = 0;
    for (long long j = i; j < n; j++) sum += a[j] - '0', mp[sum]++;
  }
  for (long long i = 0; i < n; i++) {
    long long sum = 0;
    for (long long j = i; j < n; j++) {
      sum += a[j] - '0';
      if (!k && !sum)
        ans += (n + 1) * n / 2;
      else if (sum && k % sum == 0)
        ans += mp[k / sum];
    }
  }
  cout << ans << endl;
}
