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;
template <typename T>
inline T Max(T a, T b) {
  return a > b ? a : b;
}
template <typename T>
inline T Min(T a, T b) {
  return a < b ? a : b;
}
template <typename T>
inline void checkMax(T &a, T b) {
  if (a < b) a = b;
}
template <typename T>
inline void checkMin(T &a, T b) {
  if (a > b) a = b;
}
template <typename T>
inline T Abs(T a) {
  return a > 0 ? a : -a;
}
int a;
string s;
int num[4005];
int SumR[4005];
int Cnt[50000];
long long ans;
void work() {
  cin >> s;
  int len = s.length();
  for (int i = 0; i < len; i++) {
    num[i] = s[i] - '0';
  }
  for (int i = 0; i < len; i++) {
    if (i == 0)
      SumR[i] = num[i];
    else
      SumR[i] = SumR[i - 1] + num[i];
  }
  memset(Cnt, 0, sizeof(Cnt));
  for (int i = 0; i < len; i++) {
    for (int j = i; j < len; j++) {
      int tmp = SumR[j];
      if (i != 0) tmp -= SumR[i - 1];
      Cnt[tmp]++;
    }
  }
  ans = 0;
  for (int i = 0; i < len; i++) {
    for (int j = i; j < len; j++) {
      int tmp = SumR[j];
      if (i != 0) tmp -= SumR[i - 1];
      if (tmp != 0) {
        if (a % tmp == 0) {
          long long div = a / tmp;
          if (div <= SumR[len - 1]) {
            ans += Cnt[div];
          }
        }
      } else {
        if (a == 0) {
          ans += len * (len + 1) / 2;
        }
      }
    }
  }
  cout << ans << endl;
}
int main() {
  while (cin >> a) {
    work();
  }
  return 0;
}
