#include <bits/stdc++.h>
using namespace std;
long long presum[1000007];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, k, ans = 0;
  cin >> n;
  string str;
  cin >> str;
  memset(presum, 0, sizeof(presum));
  for (int i = 0; i < str.size(); ++i) presum[i + 1] = presum[i] + str[i] - '0';
  vector<long long> v;
  unordered_map<long long, long long> m;
  for (int i = 1; i <= str.size(); ++i) {
    for (int j = i; j <= str.size(); ++j)
      v.push_back(presum[j] - presum[i - 1]), m[presum[j] - presum[i - 1]]++;
  }
  for (int i = 0; i < v.size(); ++i) {
    if (v[i] != 0) ans += m[n / v[i]] * (n % v[i] == 0);
    if (n == 0) ans += m[0];
  }
  cout << ans << "\n";
}
