#include <bits/stdc++.h>
using namespace std;
const long double pi = acos(-1.0);
const double EPS = 1E-9;
const int inf = (1e+9);
const int NMAX = 1e+5;
const int MOD = 1743;
int n, k, a;
string s;
int q[100100];
long long ans = 0;
int main() {
  cin >> a;
  cin >> s;
  n = (int)(s).size();
  for (int i = 0; i < (n); ++i) {
    int sum = 0;
    for (int j = (i); j <= (n - 1); ++j) {
      sum += s[j] - '0';
      q[sum]++;
    }
  }
  for (int i = 0; i < (n); ++i) {
    int sum = 0;
    for (int j = (i); j <= (n - 1); ++j) {
      sum += s[j] - '0';
      if (a == 0) {
        if (sum == 0)
          ans += n * (n + 1) / 2;
        else
          ans += q[0];
      } else {
        if (sum != 0 && (a % sum) == 0 & (a / sum < 100000)) ans += q[a / sum];
      }
    }
  }
  cout << ans;
}
