#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);
      else if (cot == 0 && a == 0)
        ve.push_back(cot);
    }
  }
  sort(ve.begin(), ve.end());
  long long ans = 0;
  int sz = ve.size();
  for (int i = 0; i < sz; i++) {
    if (ve[i] == 0)
      ans += len * (len + 1) / 2;
    else {
      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;
}
