#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 3;
const long long int M = 998244353;
void solve() {
  long long int a, c = 0;
  cin >> a;
  string s;
  cin >> s;
  int n = s.length();
  std::map<long long int, long long int> map;
  for (int xs = 0; xs < n; ++xs) {
    long long int ans = 0;
    for (int i = xs; i < n; ++i) {
      ans += s[i] - '0';
      map[ans]++;
    }
  }
  for (int xs = 0; xs < n; ++xs) {
    long long int ans = 0;
    for (int i = xs; i < n; ++i) {
      ans += s[i] - '0';
      if (ans > a) break;
      if (!ans) continue;
      if (!(a % ans)) c += map[a / ans];
    }
  }
  if (!a)
    for (int i = 1; i <= 9 * n; i++) c += map[0] * map[i] * 2;
  if (!a) c += map[0] * map[0];
  cout << c;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solve(), cout << "\n";
  return 0;
}
