#include <bits/stdc++.h>
using namespace std;
long long x, ans = 0;
int n, a[100100];
string s;
map<long long, long long> m;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> x >> s;
  n = s.size();
  for (int i = 0; i < n; i++) a[i] = s[i] - '0';
  for (int i = 0; i < n; i++) {
    long long t = 0;
    for (int j = i; j < n; j++) {
      t += a[j];
      m[t]++;
    }
  }
  for (auto i : m) {
    if (i.first == 0) {
      if (x == 0) {
        ans += i.second * n * (n + 1) - i.second * i.second;
      }
      continue;
    }
    if (x == 0) continue;
    if (x % i.first != 0 or m.count(x / i.first) == 0) continue;
    ans += i.second * m[x / i.first];
  }
  cout << ans;
}
