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 = 3e5 + 3;
const long long int M = 998244353;
void solve() {
  long long int a, c = 0;
  cin >> a;
  string s;
  cin >> s;
  int n = s.length();
  std::map<long long int, long long int> map;
  for (int xs = 0; xs < n; ++xs) {
    long long int ans = 0;
    for (int i = xs; i < n; ++i) {
      ans += s[i] - '0';
      map[ans]++;
    }
  }
  for (int xs = 0; xs < n; ++xs) {
    long long int ans = 0;
    for (int i = xs; i < n; ++i) {
      ans += s[i] - '0';
      if (ans > a) break;
      if (!ans) continue;
      if (!(a % ans)) c += map[a / ans];
    }
  }
  if (!a)
    for (int i = 1; i <= 9 * n; i++) c += map[0] * map[i] * 2;
  if (!a) c += map[0] * map[0];
  cout << c;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solve(), cout << "\n";
  return 0;
}
