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;
map<long long, long long> m1;
long long dp[1000][1000];
bool used[100001];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(dp, 0, sizeof(dp));
  long long a;
  string s1;
  cin >> a >> s1;
  long long ans = 0;
  long long count[100005] = {0};
  long long matrix[4005] = {0};
  for (long long i = 0; i < s1.size(); i++) {
    matrix[i] = 1LL * (s1[i] - '0');
  }
  count[matrix[0]]++;
  for (long long i = 1; i < s1.size(); i++) {
    matrix[i] += matrix[i - 1];
    count[matrix[i]]++;
  }
  for (long long i = 0; i < s1.size(); i++) {
    for (long long j = i + 1; j < s1.size(); j++) {
      count[matrix[j] - matrix[i]]++;
    }
  }
  for (long long i = 1; i <= 100000; i++) {
    if ((a % i == 0) && (a / i <= 100000)) {
      ans += count[i] * count[a / i];
    }
  }
  if (a == 0) {
    ans *= 2LL;
    ans += count[0] * count[0];
  }
  cout << ans;
  return 0;
}
