#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, e;
char s1[100007], s2[1000007];
long long h[1000007] = {0}, p[1000007], co = 1e9 + 7;
int main() {
  scanf("%s", s1);
  scanf("%s", s2);
  int l1 = strlen(s1), l2 = strlen(s2);
  p[0] = 1;
  for (int i = 1; i <= 1000005; i++) p[i] = p[i - 1] * 26 % co;
  for (int i = 1; i <= l2; i++)
    h[i] = h[i - 1] + p[i - 1] * (s2[i - 1] - 'a') % co;
  int n0 = 0, n1 = 0, ans = 0;
  for (int i = 1; i <= l1; i++)
    if (s1[i - 1] == s1[0])
      n0++;
    else
      n1++;
  for (int i = 1; i <= (l2 - 1) / n0; i++)
    if ((l2 - i * n0) % n1 == 0) {
      b = 0;
      c = (l2 - i * n0) / n1;
      int f = 1;
      long long ha = -1, hb = -1;
      int p2 = 0;
      for (int j = 0; j <= l1 - 1; j++)
        if (s1[j] == s1[0]) {
          if (ha == -1)
            ha = ((h[b + i] - h[b]) % co + co) % co;
          else if (ha * p[b] % co != ((h[b + i] - h[b]) % co + co) % co) {
            f = 0;
            break;
          }
          b += i;
        } else {
          if (hb == -1)
            hb = ((h[b + c] - h[b]) % co + co) % co, p2 = b;
          else if (hb * p[b - p2] % co != ((h[b + c] - h[b]) % co + co) % co) {
            f = 0;
            break;
          }
          b += c;
        }
      if (f && i == c && ha * p[p2] % co == hb) ans--;
      if (f) ans++;
    }
  printf("%d\n", ans);
  return 0;
}
