#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INF64 = 0x3f3f3f3f3f3f3f3f;
const int N = 1e5 + 10;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int a;
  cin >> a;
  string s;
  cin >> s;
  int n = s.size();
  for (auto &i : s) i -= '0';
  map<int, int> mp;
  for (int i = 0; i < n; ++i) {
    int sum = 0;
    for (int j = i; j < n; ++j) {
      sum += s[j];
      ++mp[sum];
    }
  }
  long long ans = 0;
  for (int i = 0; i < n; ++i) {
    int sum = 0;
    for (int j = i; j < n; ++j) {
      sum += s[j];
      if (sum == 0) {
        if (a == 0) {
          ans += n * (n + 1) / 2;
        }
      } else if (a % sum == 0) {
        auto it = mp.find(a / sum);
        if (it != mp.end()) {
          do {
          } while (0);
          ans += it->second;
        }
      }
    }
  }
  cout << ans << '\n';
  return 0;
}
