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;
string k;
int s(int i) { return (k[i] - '0'); }
long long dp[40000];
int main() {
  long long r;
  cin >> r;
  cin >> k;
  int n = k.size();
  long long res = 0;
  for (int i = 0; i < n; i++) {
    long long val = 0;
    for (int j = i; j < n; j++) {
      val += s(j);
      dp[val]++;
    }
  }
  for (int i = 1; i < 40000; i++) {
    if (r % i) continue;
    long long aux = r / i;
    if (0 <= aux && aux < 40000) res += (dp[i] * dp[aux]);
  }
  if (r == 0)
    for (int i = 0; i < 40000; i++) {
      res += (dp[0] * dp[i]);
    }
  cout << res;
  return 0;
}
