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 int N = 1e6 + 10, mod = 7 + 1e9;
const double eps = 1e-9;
inline int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
inline int mul(int a, int b) { return (long long)a * b % mod; }
int cum[N];
int sum(int l, int r) { return cum[r] - (l == 0 ? 0 : cum[l - 1]); }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int a;
  string s;
  cin >> a >> s;
  cum[0] = s[0] - '0';
  for (int i = 1; i < s.size(); ++i) {
    cum[i] = cum[i - 1] + s[i] - '0';
  }
  map<int, int> mp;
  for (int i = 0; i < s.size(); ++i) {
    for (int j = i; j < s.size(); ++j) {
      mp[sum(i, j)]++;
    }
  }
  long long cnt = 0;
  for (int i = 0; i < s.size(); ++i) {
    for (int j = i; j < s.size(); ++j) {
      if (a == 0) cnt += mp[0];
      if (sum(i, j) != 0 && a % sum(i, j) == 0) cnt += mp[a / sum(i, j)];
    }
  }
  cout << cnt;
}
