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 long long inf = 1e18;
const int nax = 2e5;
const long long mod = 1e9 + 7;
long long a, pre[4005];
string s;
map<long long, long long> mp;
long long ans = 0;
int main(int argc, char** argv) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cin >> a;
  cin >> s;
  long long sz = (long long)s.size();
  for (int i = 0; i < sz; i++) {
    pre[i + 1] = pre[i] + (s[i] - '0');
  }
  for (int i = 0; i < sz; i++) {
    for (int j = i + 1; j <= sz; j++) mp[pre[j] - pre[i]]++;
  }
  for (int i = 1; i * i <= a; i++) {
    if (a % i == 0) {
      long long temp = mp[i] * mp[a / i];
      if (a / i == i)
        ans += temp;
      else
        ans += (2 * temp);
    }
  }
  long long xp = (sz * (sz + 1));
  if (a == 0) ans = mp[0] * xp - (mp[0] * mp[0]);
  cout << ans << endl;
  return 0;
}
