#include <bits/stdc++.h>
using namespace std;
const int max_n = 1000005;
const long long mod = 1e9 + 7;
const int seed = 233;
char s[max_n], t[max_n];
long long hs[max_n], p[max_n];
void shash(char *s) {
  p[0] = 1;
  int len = strlen(s + 1);
  for (int i = 1; i <= len; i++) {
    p[i] = p[i - 1] * seed % mod;
    hs[i] = (hs[i - 1] * seed + s[i]) % mod;
  }
}
bool check(int x, int y, char c) {
  long long h1 = -1, h2 = -1;
  long long tl = 0, th;
  int l, r;
  for (int i = 1; s[i]; i++) {
    if (s[i] == c) {
      l = tl + 1, r = tl + 1 + x - 1;
      th = hs[r] + mod - hs[l - 1] * p[x] % mod, th %= mod;
      if (h1 == -1)
        h1 = th;
      else if (h1 != th)
        return false;
      tl += x;
    } else {
      l = tl + 1, r = tl + 1 + y - 1;
      th = hs[r] + mod - hs[l - 1] * p[y] % mod, th %= mod;
      if (h2 == -1)
        h2 = th;
      else if (h2 != th)
        return false;
      tl += y;
    }
  }
  if (h1 == h2) return false;
  return true;
}
int main() {
  scanf("%s%s", s + 1, t + 1);
  int len1 = strlen(s + 1), len2 = strlen(t + 1);
  int cnt = 0;
  char c = '0';
  for (int i = 1; i <= len1; i++)
    if (s[i] == '0') cnt++;
  if (cnt * 2 < len1) cnt = len1 - cnt, c = '1';
  shash(t);
  int ans = 0;
  for (int i = 1; i <= len2; i++) {
    if (1ll * i * cnt >= len2) break;
    if ((len2 - 1ll * i * cnt) % (len1 - cnt)) continue;
    if (check(i, (len2 - 1ll * i * cnt) / (len1 - cnt), c)) ans++;
  }
  printf("%d\n", ans);
  return 0;
}
