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 MAXINT = 1111 * 1111 * 1111;
const long long MAXLINT = MAXINT * 1ll * MAXINT;
const long double EPS = 1e-10;
int a;
string s;
map<long long, long long> cnt;
int main() {
  cout.sync_with_stdio(false);
  cin >> a >> s;
  for (int i = 0; s[i]; i++) {
    int sum = 0;
    for (int j = i; s[j]; j++) {
      sum += s[j] - '0';
      cnt[sum]++;
    }
  }
  long long ans = 0;
  for (int i = 1; i * i <= a; i++)
    if (!(a % i)) {
      ans += cnt[i] * cnt[a / i];
      if (i * i != a) ans += cnt[i] * cnt[a / i];
    }
  if (!a) ans += cnt[0] * (s.size() + 1) * s.size() - cnt[0] * cnt[0];
  cout << ans;
  return 0;
}
