#include <bits/stdc++.h>
using namespace std;
const int N = 4003;
int t[N][N];
int a;
string s;
map<long long, long long> mp;
long long acc[N];
int main() {
  cin >> a >> s;
  int n = s.size();
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) t[i][j] = (s[i] - '0') * (s[j] - '0');
  for (int i = 0; i < n; i++) {
    long long sum = 0;
    for (int j = 0; j <= i; j++) sum += (s[j] - '0');
    acc[i] = sum;
  }
  acc[-1] = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j <= i; j++) {
      long long sum = acc[i] - acc[j - 1];
      mp[sum]++;
    }
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    long long sum = 0;
    for (int j = 0; j <= i; j++) {
      sum = acc[i] - acc[j - 1];
      if (sum)
        if (a % sum == 0) {
          ans += mp[a / sum];
        }
      if (!sum && !a) ans += n * (n + 1) / 2;
    }
  }
  cout << ans;
}
