#include <bits/stdc++.h>
void quit();
using namespace std;
const long double PI = acos((double)-1.0);
const long double EPS = 1e-11;
double __t;
long long n, ts;
string s;
long long k[100100];
long long ans, knn;
int main() {
  cin >> n >> s;
  for (int l = 1; l <= s.size(); l++) {
    ts = 0;
    for (int j = 0; j < (int)l; ++j) ts += s[j] - '0';
    k[ts]++;
    if (ts > 0) knn++;
    for (int j = 0; j < (int)s.size() - l; ++j) {
      ts += s[j + l] - s[j];
      k[ts]++;
      if (ts > 0) knn++;
    }
  }
  if (n == 0) {
    cout << ((long long)(s.size() * (s.size() + 1)) / 2) *
                    ((long long)(s.size() * (s.size() + 1)) / 2) -
                knn * knn
         << endl;
    return 0;
  }
  for (int i = 1; i < 100100; i++)
    if (n % i == 0 && n / i < 100100) ans += k[i] * k[n / i];
  cout << ans;
  quit();
}
void quit() { exit(0); }
