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 mod = 1e9 + 7;
int dp[40000];
std::map<long long, long long> freq;
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int a;
  cin >> a;
  string second;
  cin >> second;
  for (int i = 0; i < second.length(); ++i) {
    dp[i + 1] = second[i] - '0';
    dp[i + 1] += dp[i];
  }
  for (int i = 1; i <= second.length(); ++i) {
    for (int j = i; j <= second.length(); ++j) {
      freq[dp[j] - dp[i - 1]]++;
    }
  }
  long long ans = 0;
  if (a == 0) {
    for (int i = 0; i <= 40000; ++i) {
      ans += freq[0] * 1LL * freq[i];
    }
  }
  for (int i = 1; i <= 40000; ++i) {
    if (a % i == 0) {
      ans += freq[i] * 1LL * freq[(int)a / i];
    }
  }
  cout << ans;
  return 0;
}
