#include <bits/stdc++.h>
using namespace std;
const int N = 5000;
const int M = 50000;
char str[N];
int cntS[M];
int main() {
  int a;
  scanf("%d", &a);
  scanf(" %s", str);
  int len = strlen(str);
  for (int i = 0; i < len; i++) {
    int curSum = 0;
    for (int s = i; s < len; s++) {
      curSum += str[s] - '0';
      cntS[curSum]++;
    }
  }
  long long ans = 0;
  if (a == 0) {
    long long allC = (long long)len * (long long)(len + 1) / (long long)2;
    long long allZ = cntS[0];
    ans = 2 * (allC - allZ) * allZ + allZ * allZ;
    printf("%lld", ans);
    return 0;
  }
  for (int i = 0; i < len; i++) {
    int curSum = 0;
    for (int s = i; s < len; s++) {
      curSum += str[s] - '0';
      if (curSum == 0) continue;
      int t = a / curSum;
      if (t * curSum == a && t < M) {
        ans += cntS[t];
      }
    }
  }
  printf("%lld", ans);
  return 0;
}
