/**
 *    author:  zjsdut
 *    created: 2020/01/17 01:33:31
**/
#include <bits/stdc++.h>

using namespace std;

struct fast_ios {
    fast_ios() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    };
} fast_ios_;

template<typename A, typename B>
bool chkmin(A &a, const B &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename A, typename B>
bool chkmax(A &a, const B &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
istream &operator>>(istream &stream, vector<T> &vec) {
    for (auto &x : vec) stream >> x;
    return stream;
}

void scan() {}

template<class T, class ...Args>
void scan(T &a, Args &...rest) {
    cin >> a;
    scan(rest...);
}

using ll = long long;
using vl = vector<ll>;
using vb = vector<bool>;
using vi = vector<int>;
template<typename T> using vv = vector<vector<T>>;
#define rng(i, a, b) for(int i = (int)(a); i < (int)(b); ++i)
#define up(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define down(i, b, a) for (int i = int(b); i >= int(a); i--)
#define rep(n) for(int _iter_##n = 0, _num_##n = (int)n; _iter_##n < _num_##n; ++_iter_##n)
#define FOR(x, cont) for (const auto &x: cont)
#define For(x, cont) for (auto &x: cont)
#define all(x) begin(x), end(x)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ep emplace
#define SZ(x) (int)(x).size()
#define UNIQ(vec) (vec).erase(unique(all(vec)), end(vec))
#define LB(cont, x) int(lower_bound(all(cont), x) - begin(cont))
#define UB(cont, x) int(upper_bound(all(cont), x) - begin(cont))

template<typename T>
ostream &operator<<(ostream &stream, const vector<T> &vec) {
    if (!vec.empty()) {
        stream << vec[0];
        for (size_t i = 1; i != vec.size(); ++i)
            stream << ' ' << vec[i];
    }
    return stream;
}

template<typename T>
void print(const vector<T> &t) { cout << t << '\n'; }

template<typename T>
void print(const vector<vector<T>> &t) {
    for (const auto &row : t) {
        print(row);
    }
}

template<typename T>
void print(const T &t) { cout << t << ' '; }

template<typename T, typename ...Args>
void print(const T &t, const Args &...rest) {
    print(t);
    print(rest...);
}

template<typename T>
void println(const T &t) { cout << t << '\n'; }

template<typename T, typename ...Args>
void println(const T &t, const Args &...rest) {
    print(t);
    println(rest...);
}

template<typename T>
int get_next(const T *pattern, const vector<int> &fail, const T chara, int i) {
    while (i != -1 && pattern[i] != chara)
        i = fail[i];
    return i + 1;
}

template<typename T>
vector<int> get_fail(const T *pattern, const int len_pattern) {
    assert(len_pattern > 0);
    vector<int> fail(len_pattern + 1);
    fail[0] = -1;
    for (int i = 1; i <= len_pattern; i++) {
        fail[i] = get_next(pattern, fail, pattern[i - 1], fail[i - 1]);
    }
    return fail;
}

template<typename T>
vector<int> KMP_match(const T *pattern, const int len_pattern, const T *text, const int len_text) {
    auto fail = get_fail(pattern, len_pattern);
    vector<int> shifts;
    for (int i = 0, j = 0; i < len_text; ++i) {
        j = get_next(pattern, fail, text[i], j);
        if (j == len_pattern) {
            j = fail[j];
            shifts.push_back(i + 1 - len_pattern);
        }
    }
    return shifts;
}

int main() {
#if defined LOCAL
    ifstream in("in.txt");
    cin.rdbuf(in.rdbuf());
#endif
    // consider the condition that i can be infinite.
    // consider shifts of t in copies of s.
    string s, t;
    scan(s, t);
    int text_len = SZ(s) - 1 + SZ(t);
    vector<char> text(text_len);
    rng (i, 0, text_len) {
        text[i] = s[i % SZ(s)];
    }
    vi shifts = KMP_match(t.data(), SZ(t), text.data(), text_len);
    vv<int> g(SZ(s));
    FOR (x, shifts) {
       g[x].pb((x + SZ(t)) % SZ(s));
    }
    vi topo;
    vi vis(SZ(s));
    function<void(int)> dfs = [&](int u) {
        vis[u] = -1;
        FOR (v, g[u]) {
            if (vis[v] == -1) {
                println("-1");
                exit(0);
            }
            if (vis[v] == 0) {
                dfs(v);
            }
        }
        vis[u] = 1;
        topo.pb(u);
    };
    rng (i, 0, SZ(s)) {
        if (!vis[i]) {
            dfs(i);
        }
    }
    vi dis(SZ(s));
    FOR (u, topo) {
        FOR (v, g[u]) {
            chkmax(dis[u], dis[v] + 1);
        }
    }
    println(*max_element(all(dis)));
    return 0;
}

Measured memory_bytes: 59412