#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 20;
long long A, p[N];
char s[N];
map<long long, long long> mp;
int main() {
  while (cin >> A) {
    p[0] = 0, mp.clear();
    scanf("%s", s + 1);
    int n = strlen(s + 1);
    for (int i = 1; i <= n; i++) p[i] = p[i - 1] + (s[i] - '0');
    long long res = 0, zero = 0;
    for (int i = 0; i <= n; i++) {
      for (int j = i + 1; j <= n; j++) {
        mp[p[j] - p[i]]++;
        if (p[j] - p[i])
          res++;
        else
          zero++;
      }
    }
    long long ans = 0;
    if (A == 0) {
      ans += (zero * res) * 2ll + zero * zero;
      cout << ans << endl;
      continue;
    }
    for (int i = 0; i <= n; i++) {
      for (int j = i + 1; j <= n; j++) {
        long long x = p[j] - p[i];
        if (x == 0) continue;
        if (x && (A % x) == 0) ans += mp[A / x];
      }
    }
    cout << ans << endl;
  }
  return 0;
}
