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;
int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, -1, 1, 1, -1};
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
void PLAY() {
  cout << fixed << setprecision(10);
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int main() {
  PLAY();
  int a;
  cin >> a;
  string s;
  cin >> s;
  map<long long, int> mp;
  long long sum = 0;
  for (int i = 0; i < (int)s.size(); i++) {
    sum = 0;
    for (int j = i; j < (int)s.size(); j++) {
      sum += s[j] - '0';
      mp[sum]++;
    }
  }
  long long res = 0;
  for (int i = 0; i < (int)s.size(); i++) {
    sum = 0;
    for (int j = i; j < (int)s.size(); j++) {
      sum += s[j] - '0';
      if (sum && a % sum == 0)
        res += mp[a / sum];
      else if (a + sum == 0)
        res += ((long long)(int)s.size() * ((int)s.size() + 1)) / 2;
    }
  }
  cout << res << endl;
  return 0;
}
