#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 50;
const int MOD = 1e9 + 7;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
bool dbg = false;
vector<int> zalgorithm(string s) {
    int n = s.size();
    vector<int> ret(n, 0);
    ret[0] = n;
    int i = 1, j = 0;
    while (i < n) {
        while (i + j < n && s[j] == s[i + j])
            j++;
        ret[i] = j;
        if (j == 0) {
            i++;
            continue;
        }
        int k = 1;
        while (i + k < n && k + ret[k] < j)
            ret[i + k] = ret[k], k++;
        i += k;
        j -= k;
    }
    return ret;
}

string S, T;
string s;
vector<vector<int>> G;
vector<vector<int>> GG;

void solve() {
    while (s.size() < T.size()) {
        s.insert(s.end(), all(S));
    }
    S = s;
    string s = T + '#' + S + S;
    vector<itn> z = zalgorithm(s);
    int N = T.size();
    int M = S.size();
    G.resize(S.size());
    vector<int> V(M);
    FOR(i, 0, M) {
        if (z[N + 1 + i] >= N) {
            G[i].eb((i + N) % M);
            V[(i + N) % M]++;
            //       cerr << i << " -> " << (i + N) % M << endl;
        }
    }
    queue<int> que;
    vector<int> TOP;
    FOR(M) {
        if (V[i] == 0) {
            que.push(i);
        }
    }
    vector<int> cnt(M, 0);
    vector<int> check(M, 0);
    int ans = 0;
    while (!que.empty()) {
        int idx = que.front();
        que.pop();
        if (check[idx]) {
            break;
        }
        check[idx] = 1;
        TOP.eb(idx);
        for (auto& nxt : G[idx]) {
            V[nxt]--;
            if (V[nxt] == 0) {
                que.push(nxt);
                chmax(cnt[nxt], cnt[idx] + 1);
                chmax(ans, cnt[nxt]);
            }
        }
    }
    //cout << TOP.size() << " " << M << endl;
    if (TOP.size() != M) {
        cout << -1 << endl;
        return;
    } else {
        cout << ans << endl;
        return;
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin >> S >> T;


    solve();
    return 0;
}


Measured memory_bytes: 101864