#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
struct Hasher {
  vector<ll> power = {1}, pref = {0};
  ll mod, q;
  char c;
  Hasher(const string& s, ll m, ll _q, char _c) : mod(m), q(_q), c(_c) {
    for (char x : s) {
      power.push_back(power.back() * q % mod);
      pref.push_back((pref.back() * q % mod + (x - c)) % mod);
    }
  }
  ll hash(int l, int r) {
    return (pref[r] - power[r - l] * pref[l] % mod + mod) % mod;
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  string a, b;
  cin >> a >> b;
  Hasher hash(b, 1700000009, 29, 'a');
  vector<ll> count(2);
  vector<ll> pos(2, 0x3FFFFFFFFFFll);
  for (ll i = 0; i < (int)(a).size(); i++) {
    count[a[i] - '0']++;
    pos[a[i] - '0'] = min(i, pos[a[i] - '0']);
  }
  ll res = 0;
  for (ll i = 1; ((int)(b).size() - count[0] * i) > 0; i++) {
    if (((int)(b).size() - count[0] * i) % count[1] == 0) {
      ll j = ((int)(b).size() - count[0] * i) / count[1];
      bool ok = true;
      vector<ll> length = {i, j};
      vector<ll> compPos = {j * pos[0], i * pos[1]};
      vector<ll> comp = {hash.hash(j * pos[0], j * pos[0] + length[0]),
                         hash.hash(i * pos[1], i * pos[1] + length[1])};
      if (comp[0] == comp[1] && i == j) continue;
      for (ll c = 0, d = 0; c < (int)(a).size() && ok; c++) {
        ll cur = a[c] - '0';
        ok = hash.hash(d, d + length[cur]) == comp[cur];
        d += length[cur];
      }
      if (ok) res++;
    }
  }
  cout << res << endl;
}
