#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 123;
const long long INF = (long long)1e18 + 123;
const int inf = (int)1e9 + 123;
const int MOD = (int)1e9 + 7;
int x, n, a[4001];
string s;
int pref[4001], cnt[1000000];
long long res;
int main() {
  cin >> x >> s;
  n = (int)(s.size());
  for (int i = 0; i < (int)(s.size()); i++) {
    a[i + 1] = s[i] - '0';
  }
  for (int i = 1; i <= n; i++) {
    pref[i] = pref[i - 1] + a[i];
  }
  long long tot = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j++) {
      if (pref[j] - pref[i - 1] < 1000000) tot++, cnt[pref[j] - pref[i - 1]]++;
    }
  }
  for (int len = 1; len <= n; len++) {
    for (int i = 1; i + len - 1 <= n; i++) {
      int rv = -1;
      if (pref[i + len - 1] - pref[i - 1] > 0) {
        if (x % (pref[i + len - 1] - pref[i - 1]) == 0 &&
            x / (pref[i + len - 1] - pref[i - 1]) <= 50000) {
          rv = x / (pref[i + len - 1] - pref[i - 1]);
          res += cnt[rv];
        }
      } else {
        if (x == 0) res += tot;
      }
    }
  }
  cout << res;
  return 0;
}
