#include <bits/stdc++.h>
using namespace std;
char s[4010];
int sum[4010];
int cnt[4010 * 9];
int main() {
  int a;
  scanf("%d%s", &a, s);
  int len = strlen(s);
  sum[0] = s[0] - '0';
  long long sol = 0;
  for (int i = 1; i < len; i++) sum[i] = (s[i] - '0') + sum[i - 1];
  for (int i = 0; i < len; i++)
    for (int j = i; j < len; j++) {
      int tmp = sum[j] - (i > 0 ? sum[i - 1] : 0);
      cnt[tmp]++;
    }
  for (int i = 0; i < len; i++)
    for (int j = i; j < len; j++) {
      int tmp = sum[j] - (i > 0 ? sum[i - 1] : 0);
      if (a == 0) {
        if (tmp != 0) {
          sol += (long long)cnt[0];
        } else
          sol += (long long)(len * (len + 1)) / 2;
      } else if (tmp != 0 && a % tmp == 0) {
        if (a / tmp < 4010 * 9) sol += (long long)cnt[a / tmp];
      }
    }
  printf("%lld\n", sol);
  return 0;
}
