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