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 long long MAXN = 1e5 + 100;
int a[MAXN];
map<int, long long> cnt;
int main() {
  ios::sync_with_stdio(0);
  int a;
  string s;
  cin >> a >> s;
  int n = s.size();
  for (int i = 0; i < n; i++) {
    int x = s[i] - '0';
    if (x && a % x == 0) cnt[x]++;
    if (x == 0) cnt[0]++;
    for (int j = i + 1; j < n; j++) {
      x += s[j] - '0';
      if (x && a % x == 0) cnt[x]++;
      if (x == 0) cnt[0]++;
    }
  }
  long long ans = 0;
  for (map<int, long long>::iterator iter = cnt.begin(); iter != cnt.end();
       iter++)
    if (iter->first) ans += iter->second * (cnt[a / iter->first]);
  if (a == 0) ans = 2 * ans + cnt[0] * cnt[0];
  cout << ans << endl;
}
