#include <bits/stdc++.h>
using namespace std;
const int maxn = 4010;
char num[maxn];
long long a;
vector<int> ve;
int main() {
  scanf("%I64d", &a);
  scanf("%s", &num);
  int len = strlen(num), non_zero = 0, zero = 0;
  for (int i = 0; i < len; i++) {
    long long cot = 0;
    for (int j = i; j < len; j++) {
      cot += num[j] - '0';
      if (cot != 0 && a % cot == 0) ve.push_back(cot);
      if (cot > 0)
        non_zero++;
      else if (cot == 0)
        zero++;
    }
  }
  if (a == 0) {
    long long all = (zero + non_zero);
    cout << (long long)all * all - (long long)non_zero * non_zero << endl;
  } else {
    sort(ve.begin(), ve.end());
    long long ans = 0;
    int sz = ve.size();
    for (int i = 0; i < sz; i++) {
      int kk = a / ve[i];
      int id = lower_bound(ve.begin(), ve.end(), kk) - ve.begin();
      int tt = upper_bound(ve.begin(), ve.end(), kk) - ve.begin();
      if (ve[id] == kk) {
        ans += tt - id;
      }
    }
    cout << ans << endl;
  }
  return 0;
}
