#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
//#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define BIT(n) (1LL << (n))
#define TOUPPER(s) transform(s.begin(), s.end(), s.begin(), ::toupper)
#define TOLOWER(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
#define FILLZERO(s, n)                      \
    do {                                    \
        ostringstream os;                   \
        os << setw(n) << setfill('0') << s; \
        s = os.str();                       \
    } while (0);
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //sortしてからつかうこと
#define INIT                               \
    std::cin.tie(nullptr);                 \
    std::ios_base::sync_with_stdio(false); \
    cout << std::fixed << std::setprecision(10);

using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using pi = pair<int, int>;
template <typename T>
using Pq = priority_queue<T>;
template <typename T>
using pQ = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
vector<T> make_vec(size_t a, T n) { return vector<T>(a, n); }
template <typename T, typename... Ts>
auto make_vec(size_t a, Ts... ts) { return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...)); }
template <class T>
inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &x : vec)
        is >> x;
    return is;
}

constexpr ll MOD = 1e9 + 7;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;

//text内でpatternに一致する文字列の先頭のインデックスすべてを返す
vector<int> kmpSearch(const string &text, const string &pattern) {
    int pN = pattern.size(), tN = text.size();
    vector<int> table(pN + 1);
    table[0] = -1;
    int j = -1;
    for (int i = 0; i < pN; i++) {
        while (j >= 0 && pattern[i] != pattern[j])
            j = table[j];
        j++;
        if (pattern[i + 1] == pattern[j])
            table[i + 1] = table[j];
        else
            table[i + 1] = j;
    }
    int i = 0;
    j = 0;
    vi res;
    while (j < tN) {
        while (i > -1 && pattern[i] != text[j])
            i = table[i];
        i++;
        j++;
        if (i >= pN) {
            res.push_back(j - i);
            i = table[i];
        }
    }
    return res;
}

struct Edge {
    int from, to, cost;
    Edge(int from, int to, int cost = 1) : from(from), to(to), cost(cost) {}
};
//0-indexedに注意
class Graph {
public:
    int verN;
    int edgeN = 0;
    vector<Edge> edges;
    vector<vector<pair<int, int>>> adjList;
    int inf = numeric_limits<int>::max();
    Graph(int verN) : verN(verN), adjList(verN) {}

    void addDirectedEdge(int from, int to, int cost = 1) {
        edges.push_back(Edge(from, to, cost));
        adjList[from].push_back(make_pair(to, cost));
        edgeN++;
    }

    void addUndirectedEdge(int from, int to, int cost = 1) {
        edges.push_back(Edge(from, to, cost));
        edges.push_back(Edge(to, from, cost));
        adjList[from].push_back(make_pair(to, cost));
        adjList[to].push_back(make_pair(from, cost));
        edgeN += 2;
    }
    int ans = 0;
    bool _cycleDetection(int now, int prev, vector<int> &seen, vector<int> &used, vector<int> &cycle) {
        if (used[now]) {
            return false;
        }
        if (seen[now]) {
            cycle.push_back(now);
            return true;
        }

        seen[now] = true;

        for (auto adj_pair : adjList[now]) {
            int adj = adj_pair.first;
            //if (prev == adj)
            //    continue;
            bool hasDetected = _cycleDetection(adj, now, seen, used, cycle);
            if (hasDetected) {
                cycle.push_back(now);
                return true;
            }
        }
        used[now] = true;

        seen[now] = false;

        return false;
    }

    bool cycleDetection(vector<int> &cycle) {
        cycle.reserve(N);
        vector<int> seen(N);
        vector<int> used(N);
        for (int start = 0; start < N; start++) {
            bool hasDetected = _cycleDetection(start, -1, seen, used, cycle);
            if (hasDetected) {
                for (int i = 1; i < (int)cycle.size(); i++) {
                    if (cycle[i] == cycle[0]) {
                        cycle.erase(cycle.begin() + i + 1, cycle.end());
                    }
                }
                reverse(cycle.begin(), cycle.end());
                //cycle.pop_back();
                return 1;
            }
        }
        return 0;
    }

    int prim(int start, vector<int> &parent) {
        parent.resize(N);
        int cost = 0;
        using P = pair<int, pair<int, int>>;
        priority_queue<P, vector<P>, greater<P>> pq;
        vector<int> used(verN, 0);
        pq.push(make_pair(0, make_pair(start, start)));
        while (!pq.empty()) {
            auto tmp = pq.top();
            pq.pop();
            int now = tmp.second.first;
            if (used[now])
                continue;
            cost += tmp.first;
            parent[now] = tmp.second.second;
            used[now] = 1;
            for (auto [adj, dist] : adjList[now]) {
                if (used[adj])
                    continue;
                pq.push(make_pair(dist, make_pair(adj, now)));
            }
        }
        return cost;
    }

    //始点から行けるすべての負閉路を検出する。
    //始点関係なくあらゆる負閉路を検出したい場合、dをすべて0で初期化する。
    bool bellmanford(int start, vector<int> &d) {
        d.resize(verN);
        for (int i = 0; i < verN; i++) {
            d[i] = inf;
        }
        d[start] = 0;
        for (int i = 0; i < verN; i++) {
            for (int j = 0; j < edgeN; j++) {
                Edge e = edges[j];
                if (d[e.from] != inf && d[e.to] > d[e.from] + e.cost) {
                    d[e.to] = d[e.from] + e.cost;
                    if (i == verN - 1) {
                        return false;
                    }
                }
            }
        }
        return true;
    }

    //始点から終点へのパス上の不閉路を検出する。
    bool bellmanford(int start, int end, vector<int> &d) {
        d.resize(verN);
        vector<int> negative(verN);
        for (int i = 0; i < verN; i++) {
            d[i] = inf;
        }
        d[start] = 0;
        for (int i = 0; i < verN; i++) {
            for (int j = 0; j < edgeN; j++) {
                Edge e = edges[j];
                if (d[e.from] != inf && d[e.to] > d[e.from] + e.cost) {
                    d[e.to] = d[e.from] + e.cost;
                    if (i == verN - 1) {
                        negative[e.to] = true;
                    }
                }
            }
        }
        for (int i = 0; i < verN; i++) {
            for (int j = 0; j < edgeN; j++) {
                Edge e = edges[j];
                if (negative[e.from]) {
                    negative[e.to] = true;
                }
            }
        }
        return !negative[end];
    }

    vector<int> dijkstra(int start) {
        vector<int> d(verN, inf);
        d[start] = 0;
        priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
        vector<int> used(verN, 0);
        pq.push(make_pair(0, start));
        while (!pq.empty()) {
            int now = pq.top().second;
            pq.pop();
            if (used[now])
                continue;
            used[now] = 1;
            for (auto [adj, dist] : adjList[now]) {
                if (used[adj])
                    continue;
                if (d[adj] > d[now] + dist) {
                    d[adj] = d[now] + dist;
                    pq.push(make_pair(d[adj], adj));
                }
            }
        }
        return d;
    }

    vector<vector<int>> warshallfloyd() {
        vector<vector<int>> d(verN, vector<int>(verN, inf));
        for (int i = 0; i < verN; i++) {
            for (auto [adj, dist] : adjList[i]) {
                d[i][adj] = dist;
            }
        }
        for (int i = 0; i < verN; i++) {
            d[i][i] = 0;
        }
        for (int k = 0; k < verN; k++) {         // 経由する頂点
            for (int i = 0; i < verN; i++) {     // 始点
                for (int j = 0; j < verN; j++) { // 終点
                    if (d[i][k] != inf && d[k][j] != inf)
                        d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
                }
            }
        }
        return d;
    }

    vector<int> topologicalSort() {
        vector<int> res;
        vector<int> used(N);
        auto dfs = [&](auto &&dfs, int now, vector<int> &res) -> void {
            if (used[now])
                return;
            used[now] = 1;
            for (auto [nxt, _] : adjList[now]) {
                dfs(dfs, nxt, res);
            }
            res.push_back(now);
        };
        for (int i = 0; i < N; i++) {
            dfs(dfs, i, res);
        }
        reverse(res.begin(), res.end());
        return res;
    }
};

signed main() {
    INIT;
    cin >> S >> T;
    string tmp;
    while (tmp.size() < T.size()) {
        tmp += S;
    }
    S = tmp;
    N = S.size();
    Graph g(N);
    auto v = kmpSearch(S + S, T);
    REP(i, v.size()) {
        if (v[i] >= N) {
            break;
        }
        int nxt = (v[i] + T.size()) % N;
        g.addDirectedEdge(v[i], nxt);
        //dump(v[i], (v[i] + T.size()) % N);
    }
    vi dum;
    if (g.cycleDetection(dum)) {
        cout << -1 << endl;
    } else {
        vi depth(N), used(N);
        auto dfs = [&](auto &&dfs, int now, int d) {
            if (used[now])
                return d + depth[now];
            depth[now] = d;
            for (auto [nxt, _] : g.adjList[now]) {
                chmax(depth[now], dfs(dfs, nxt, d + 1));
            }
            used[now] = 1;
            return depth[now];
        };
        REP(i, N) {
            if (used[i])
                continue;
            chmax(ans, (ll)dfs(dfs, i, 0));
        }
        //dump(depth);
        cout << ans << endl;
    }
}


Measured memory_bytes: 126676