#include <bits/stdc++.h>
char ch;
bool fs;
void re(int& x) {
  while (ch = getchar(), ch < 33)
    ;
  if (ch == '-')
    fs = 1, x = 0;
  else
    fs = 0, x = ch - 48;
  while (ch = getchar(), ch > 33) x = x * 10 + ch - 48;
  if (fs) x = -x;
}
using namespace std;
char s[2000001], t[2000001];
int hash1[2000001], hash2[2000001], mi1[2000001], mi2[2000001];
const int mo1 = 1000000007, mo2 = 1000000009;
int n, m, ct0, ct1, ans;
bool check(int a, int b, int c, int d) {
  return !((hash1[b] - hash1[d] -
            1ll * mi1[b - a + 1] * (hash1[a - 1] - hash1[c - 1])) %
           mo1) &&
         !((hash2[b] - hash2[d] -
            1ll * mi2[b - a + 1] * (hash2[a - 1] - hash2[c - 1])) %
           mo2);
}
int main() {
  scanf("%s", s + 1);
  scanf("%s", t + 1);
  n = strlen(s + 1);
  m = strlen(t + 1);
  for (int i = 1; i <= n; ++i)
    if (s[i] == '0')
      ++ct0;
    else
      ++ct1;
  mi1[0] = mi2[0] = 1;
  for (int i = 1; i <= m; ++i) {
    mi1[i] = 1ll * mi1[i - 1] * 27 % mo1;
    mi2[i] = 1ll * mi2[i - 1] * 27 % mo2;
    hash1[i] = (27ll * hash1[i - 1] + t[i] - 'a' + 1) % mo1;
    hash2[i] = (27ll * hash2[i - 1] + t[i] - 'a' + 1) % mo2;
  }
  for (int i = 1; i * ct0 < m; ++i) {
    int l0 = i, l1 = (m - l0 * ct0) / ct1;
    if ((m - l0 * ct0) % ct1) continue;
    int la0 = 0, la1 = 0, now = 1;
    bool ok = 1;
    for (int j = 1; j <= n; ++j)
      if (s[j] == '0') {
        if (la0 && !check(now, now + l0 - 1, la0, la0 + l0 - 1)) {
          ok = 0;
          break;
        }
        la0 = now;
        now += l0;
      } else {
        if (la1 && !check(now, now + l1 - 1, la1, la1 + l1 - 1)) {
          ok = 0;
          break;
        }
        la1 = now;
        now += l1;
      }
    if (!ok) continue;
    if (!check(la0, la0 + l0 - 1, la1, la1 + l1 - 1)) ++ans;
  }
  printf("%d\n", ans);
}
