#include <bits/stdc++.h>
const int N = 1e6 + 10;
const int INF = 1e9 + 9;
const unsigned long long MOD = 1e9 + 9;
const unsigned long long p = 29;
unsigned long long ppow[N];
unsigned long long h[N];
unsigned long long hash(int l, int r) {
  return (MOD + h[r] - h[l - 1] * ppow[r - l + 1] % MOD) % MOD;
}
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);
  std::cout.tie(0);
  ppow[0] = 1;
  for (int i = 1; i < N; i++) {
    ppow[i] = ppow[i - 1] * p % MOD;
  }
  std::string s, t;
  std::cin >> s >> t;
  int cnt0 = 0, cnt1 = 0;
  for (char i : s) {
    if (i == '0')
      cnt0++;
    else
      cnt1++;
  }
  h[0] = 0;
  for (int i = 1; i <= t.length(); i++) {
    h[i] = (h[i - 1] * p % MOD + t[i - 1] - 'a' + 1) % MOD;
  }
  unsigned long long h0, h1;
  int ans = 0;
  for (int len0 = 1; len0 <= t.length(); len0++) {
    long long sum1 = (long long)t.length() - 1ll * len0 * cnt0;
    if (sum1 % cnt1 || sum1 <= 0) continue;
    int len1 = sum1 / cnt1;
    int pos = 1, i = 0;
    h0 = h1 = MOD;
    bool good = true;
    while (i < s.length() && good) {
      if (s[i] == '0') {
        if (h0 == MOD) {
          h0 = hash(pos, pos + len0 - 1);
        } else {
          if (h0 != hash(pos, pos + len0 - 1)) {
            good = false;
          }
          i++;
          pos += len0;
        }
      } else {
        if (h1 == MOD) {
          h1 = hash(pos, pos + len1 - 1);
        } else {
          if (h1 != hash(pos, pos + len1 - 1)) {
            good = false;
          }
          i++;
          pos += len1;
        }
      }
    }
    if (good && h0 != h1) {
      ans++;
    }
  }
  printf("%d", ans);
}
