#include <bits/stdc++.h>
using namespace std;
struct strLine {
  long double a, b, c;
};
const double pi = 3.141592653589793;
long long gcd(long long a, long long b) { return (b == 0) ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long max(long long a, long long b) { return (a >= b) ? a : b; }
long long min(long long a, long long b) { return (a <= b) ? a : b; }
const pair<long long, long long> mod =
    pair<long long, long long>(1000000009, 1007050321);
const pair<long long, long long> base = pair<long long, long long>(337, 337);
long n, m, c0, c1;
string s, t;
pair<long long, long long> h[1000006], pw[1000006];
pair<long long, long long> operator%(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return pair<long long, long long>(a.first % b.first, a.second % b.second);
}
pair<long long, long long> operator*(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return pair<long long, long long>(a.first * b.first, a.second * b.second) %
         mod;
}
pair<long long, long long> operator+(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return pair<long long, long long>(a.first + b.first, a.second + b.second) %
         mod;
}
pair<long long, long long> operator-(const pair<long long, long long>& a,
                                     const pair<long long, long long>& b) {
  return (pair<long long, long long>(a.first - b.first, b.second - b.second) %
              mod +
          mod) %
         mod;
}
pair<long long, long long> get_hash(long l, long len) {
  return h[l + len - 1] - h[l - 1] * pw[len];
}
long chk(long len) {
  if (1LL * len * c0 >= m) return 0;
  if ((m - len * c0) % c1 != 0) return 0;
  long len1 = (m - len * c0) / c1;
  pair<long long, long long> key0 = get_hash(1, len);
  pair<long long, long long> key1 = pair<long long, long long>(-1, -1);
  long ptr = 1;
  for (int i = 0; i <= n - 1; i++) {
    if (s[i] == '0') {
      if (get_hash(ptr, len) != key0) return 0;
      ptr += len;
    } else {
      if (key1.first == -1)
        key1 = get_hash(ptr, len1);
      else if (get_hash(ptr, len1) != key1)
        return 0;
      ptr += len1;
    }
  }
  if (key0 == key1) return 0;
  return 1;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> s >> t;
  n = s.size();
  m = t.size();
  if (s[0] == '1')
    for (int i = 0; i <= n - 1; i++)
      if (s[i] == '1')
        s[i] = '0';
      else
        s[i] = '1';
  for (int i = 0; i < n; i++)
    if (s[i] == '0')
      c0++;
    else
      c1++;
  for (int i = 1; i <= m; i++)
    h[i] = h[i - 1] * base + pair<long long, long long>(t[i - 1], t[i - 1]);
  pw[0] = pair<long long, long long>(1, 1);
  for (int i = 1; i <= m; i++) pw[i] = pw[i - 1] * base;
  long ans = 0;
  for (int i = 1; i <= m - 1; i++) ans += chk(i);
  cout << ans;
  return 0;
}
