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;
long long presum[1000007];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, k, ans = 0;
  cin >> n;
  string str;
  cin >> str;
  memset(presum, 0, sizeof(presum));
  for (int i = 0; i < str.size(); ++i) presum[i + 1] = presum[i] + str[i] - '0';
  vector<long long> v;
  unordered_map<long long, long long> m;
  for (int i = 1; i <= str.size(); ++i) {
    for (int j = i; j <= str.size(); ++j)
      v.push_back(presum[j] - presum[i - 1]), m[presum[j] - presum[i - 1]]++;
  }
  for (int i = 0; i < v.size(); ++i) {
    if (v[i] != 0) ans += m[n / v[i]] * (n % v[i] == 0);
    if (n == 0) ans += m[0];
  }
  cout << ans << "\n";
}
