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;
map<long long int, long long int> mp;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  long long a;
  string s;
  cin >> a;
  cin >> s;
  long long ct = 0;
  for (int i = 0; i < s.size(); i++) {
    long long aa = 0;
    for (int j = i; j < s.size(); j++) {
      aa += s[j] - '0';
      mp[aa]++;
    }
  }
  int len = s.size();
  for (int i = 0; i < s.size(); i++) {
    long long aa = 0;
    for (int j = i; j < s.size(); j++) {
      aa += s[j] - '0';
      if (aa != 0 && a % aa == 0)
        ct += mp[a / aa];
      else if (aa == 0 && a == 0)
        ct += (len * (len + 1) / 2);
    }
  }
  cout << ct << "\n";
}
