#include <bits/stdc++.h>
using namespace std;
string s, t;
long long f[1000005], hashh[1000005];
long long p[5] = {31, 37, 41, 43, 47};
int a, b, n;
int main() {
  cin >> s >> t;
  n = t.size();
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '0')
      a++;
    else
      b++;
  }
  srand((unsigned)time(NULL));
  int k = rand() % 5;
  long long pr = p[k];
  long long cur = pr;
  for (int i = 0; i < n; i++) {
    f[i] = cur;
    hashh[i] = f[i] * (t[i] - 'a' + 1) % 1000000007;
    if (i) hashh[i] = (hashh[i] + hashh[i - 1]) % 1000000007;
    cur = cur * pr % 1000000007;
  }
  int ans = 0;
  for (int A = 1; A <= n / a; A++) {
    int zan = n - A * a;
    if (zan <= 0 || zan % b != 0) continue;
    long long B = zan / b;
    long long valA = -1, valB = -1;
    int nxt = 0;
    bool fail = 0;
    for (int j = 0; j < s.size(); j++) {
      if (s[j] == '0') {
        long long hs = hashh[nxt + A - 1];
        if (nxt) hs -= hashh[nxt - 1];
        hs = (hs % 1000000007 * f[n - 1 - nxt] % 1000000007 + 1000000007) %
             1000000007;
        nxt += A;
        if (valA == -1)
          valA = hs;
        else if (valA != hs)
          fail = 1;
      } else {
        long long hs = hashh[nxt + B - 1];
        if (nxt) hs -= hashh[nxt - 1];
        hs = (hs % 1000000007 * f[n - 1 - nxt] % 1000000007 + 1000000007) %
             1000000007;
        nxt += B;
        if (valB == -1)
          valB = hs;
        else if (valB != hs)
          fail = 1;
      }
    }
    assert(nxt == n);
    if (A == B && valA == valB) continue;
    if (!fail) ans++;
  }
  cout << ans << endl;
}
