#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T& RD(T& x) {
  char c;
  for (c = getchar(); c < '0'; c = getchar())
    ;
  x = c - '0';
  for (c = getchar(); '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
  return x;
}
const int maxn = 4015;
long long cnt[40005];
char s[maxn];
int sum[maxn];
int main() {
  int k;
  while (~scanf("%d", &k)) {
    scanf("%s", s);
    int len = strlen(s);
    memset(cnt, 0, sizeof(cnt));
    memset(sum, 0, sizeof(sum));
    for (int i = 1; i <= len; i++) {
      sum[i] = sum[i - 1] + s[i - 1] - '0';
    }
    for (int i = 1; i <= len; i++) {
      for (int j = i; j <= len; j++) {
        cnt[sum[j] - sum[i - 1]]++;
      }
    }
    long long ans = 0;
    if (k == 0) {
      ans = 0;
      long long tem = 0;
      for (int i = 0; i <= sum[len]; i++) tem += cnt[i];
      ans = cnt[0] * tem * 2;
      ans -= cnt[0] * cnt[0];
    } else {
      for (int i = 1; i <= sum[len]; i++) {
        if (k % i == 0 && k / i <= sum[len]) {
          ans += cnt[i] * cnt[k / i];
        }
      }
    }
    printf("%I64d\n", ans);
  }
  return 0;
}
