#include <bits/stdc++.h>
using namespace std;
string s, t;
long long pre[1100100], p = 31, cur;
long long expo(long long a, long long b) {
  long long res = 1;
  for (int i = (30); i >= (0); i--) {
    res = (res * res) % 1000000007;
    if ((1 << i) & b) res = (res * a) % 1000000007;
  }
  return res;
}
bool eq(int i1, int i2, int len) {
  long long hash1 = (pre[i1 + len] - pre[i1]) * expo(p, i2 - i1);
  long long hash2 = pre[i2 + len] - pre[i2];
  return (hash2 - hash1) % 1000000007 == 0;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> s >> t;
  cur = 1;
  for (int i = (1); i <= (t.size()); i++) {
    pre[i] = (t[i - 1] * cur + pre[i - 1]) % 1000000007;
    cur = (cur * p) % 1000000007;
  }
  int c0 = 0;
  for (auto c : s)
    if (c == '0') c0++;
  int c1 = s.size() - c0;
  if (c0 < c1) {
    for (int i = (0); i <= ((int)(s.size()) - 1); i++) s[i] = '0' + '1' - s[i];
    swap(c0, c1);
  }
  int ans = 0;
  for (int l0 = 1; l0 * c0 < t.size(); l0++)
    if ((t.size() - l0 * c0) % c1 == 0) {
      int l1 = (t.size() - l0 * c0) / c1;
      int id = 0, f0 = -1, f1 = -1;
      bool flag = false;
      for (auto c : s) {
        if (c == '0') {
          if (f0 == -1)
            f0 = id;
          else if (!eq(f0, id, l0))
            flag = true;
          id += l0;
        } else {
          if (f1 == -1)
            f1 = id;
          else if (!eq(f1, id, l1))
            flag = true;
          id += l1;
        }
      }
      if (l0 == l1 && eq(min(f0, f1), max(f0, f1), l0)) continue;
      if (!flag) ans++;
    }
  cout << ans;
}
