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;
template <class T>
void printArr(T* arr, int size) {
  for (int i = 0; i < size; i++) cout << arr[i] << " ";
  cout << endl;
}
long long fast_exp(long long x, long long y) {
  if (y == 1) return x;
  if (y == 0) return 1;
  if (y & 1)
    return x * fast_exp(x, y - 1);
  else {
    long long re = fast_exp(x, y / 2);
    return re * re;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  long long a = 0;
  string s;
  cin >> a >> s;
  unordered_map<int, int> ht;
  for (int i = 0; i < s.size(); i++) {
    int interv = 0;
    for (int j = i; j < s.size(); j++) {
      interv += s[j] - '0';
      unordered_map<int, int>::iterator it = ht.find(interv);
      if (it == ht.end()) {
        ht.insert(make_pair(interv, 1));
      } else {
        ++it->second;
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < s.size(); i++) {
    int interv = 0;
    for (int j = i; j < s.size(); j++) {
      interv += s[j] - '0';
      if (a == 0 && interv == 0) {
        long long siz = s.size() * 1LL;
        ans += ((siz) * (siz - 1) / 2) + siz;
      } else {
        if (interv != 0 && a % interv == 0) {
          long long other = a / interv;
          unordered_map<int, int>::iterator it = ht.find(other);
          if (it != ht.end()) {
            ans += it->second;
          }
        }
      }
    }
  }
  cout << ans << endl;
  return 0;
}
