#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const int inf = 1e9 + 7;
const ll INF = 1e18;
int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<typename T> T pow(T a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { for (auto &vi: vec) os << vi << " "; return os; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<typename T >inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T> inline void add(T &a, int b) { a += b; if (a >= mod) a -= mod; }


void solve();

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout << fixed << setprecision(10);

    int T;
    // cin >> T;
    T = 1;

    while (T--) {
        solve();
    }
}

struct UnionFind {
  vector<int> data;
  int sz;
  UnionFind(int _sz) : data(_sz, -1) { sz = _sz; }
  bool connect(int x, int y) {
      if ((x = root(x)) == (y = root(y))) return false;
      if (data[x] > data[y]) swap(x, y);
      data[x] += data[y]; data[y] = x; sz--;
      return true;
  }
  bool issame(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
  int size() { return sz; }
};

// https://ta7uw.hatenablog.com/entry/2019/10/13/223431
class RollingHash {
  static const ll base1 = 1009;
  static const ll base2 = 2009;
  static const ll mod1 = 1000000007;
  static const ll mod2 = 1000000009;
  vector<ll> hash1, hash2, pow1, pow2;

public:
  RollingHash(const string &S) {
    int n = (int) S.size();
    hash1.assign(n + 1, 0);
    hash2.assign(n + 1, 0);
    pow1.assign(n + 1, 1);
    pow2.assign(n + 1, 1);
    for (int i = 0; i < n; ++i) {
      hash1[i + 1] = (hash1[i] * base1 + S[i]) % mod1;
      hash2[i + 1] = (hash2[i] * base2 + S[i]) % mod2;
      pow1[i + 1] = (pow1[i] * base1) % mod1;
      pow2[i + 1] = (pow2[i] * base2) % mod2;
    }
  }

  // S の [l, r) のハッシュ値を返す
  inline pair<ll, ll> get(int l, int r) const {
    ll res1 = hash1[r] - hash1[l] * pow1[r - l] % mod1;
    if (res1 < 0) res1 += mod1;
    ll res2 = hash2[r] - hash2[l] * pow2[r - l] % mod2;
    if (res2 < 0) res2 += mod2;
    return make_pair(res1, res2);
  }
};

void solve() {
  string s, t;
  cin >> s >> t;

  // 長さの調節大事, RE になる
  string u = s + s; // debuged
  while (sz(u) < 2 * sz(t)) u += s;

  RollingHash ru(u), rt(t);
  vector<int> v(sz(s));
  rep(i, sz(s)) {
    auto ht = rt.get(0, sz(t));
    auto hu = ru.get(i, i + sz(t));
    v[i] = (ht == hu);
  }

  UnionFind uni(sz(s));
  rep(i, sz(s)) {
    int j = (i + sz(t)) % sz(s);

    if (v[i] && v[j]) {
      if (!uni.connect(i, j)) {
        cout << -1 << endl;
        return;
      }
    }
  }

  int ans = 0;
  rep(i, sz(s)) if (v[i]) chmax(ans, uni.size(i));
  cout << ans << endl;
}


Measured memory_bytes: 69660