#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

// template version 2.0
using namespace std;
#include <bits/stdc++.h>

// varibable settings
const long long INF = 1e18;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T>
inline void chmax(T &a, const T &b) {
    if ((a) < (b)) (a) = (b);
}
template <class T>
inline void chmin(T &a, const T &b) {
    if ((a) > (b)) (a) = (b);
}

#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x)    \
    sort(all(x)); \
    x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;

template <typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
    Fast() {
        std::cin.tie(0);
        ios::sync_with_stdio(false);
    }
} fast;
void check_input() {
    assert(cin.eof() == 0);
    int tmp;
    cin >> tmp;
    assert(cin.eof() == 1);
}

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"
template<class T=ll> using vec = vector<T>;

// snippet:rolling_hash {{{
template<class Z> Z rng(Z a, Z b) {
    auto tmp = mt19937(chrono::steady_clock::now().time_since_epoch().count());
    return uniform_int_distribution<Z>(a, b - 1)(tmp);
}

struct rolling_hash {
    // static constexpr uint64_t P0 = 4111144441, P1 = 4111444111;
    static constexpr uint64_t P0 = 1e9+7, P1 = 998244353;
    static uint64_t B0, B1;
    vector<ll> hash0, hash1, _bpow0, _bpow1;  // 1-index
    rolling_hash() {}
    rolling_hash(vector<ll> &vs) {
        init(vs, hash0, B0, P0, _bpow0); 
        init(vs, hash1, B1, P1, _bpow1); 
    }
    rolling_hash(string &s) {
        vector<ll> vs;
        for (char c : s) vs.emplace_back(c);
        init(vs, hash0, B0, P0, _bpow0); 
        init(vs, hash1, B1, P1, _bpow1); 
    }

    void init(vector<ll>& vs, vector<ll>& hash, ll B, ll P, vector<ll>& _bpow) {
        int n = vs.size();
        hash.assign(n + 1, 0);
        _bpow.assign(n + 1, 1);
        for (int i = 0; i < n; i++) {
            hash[i + 1] = (hash[i] * B + vs[i]) % P;
            _bpow[i + 1] = _bpow[i] * B % P;
        }
    }

    pair<ll, ll> get_hash(int l, int r) {
        ll h0 = _get_hash(l, r, hash0, B0, P0, _bpow0);
        ll h1 = _get_hash(l, r, hash1, B1, P1, _bpow1);
        return {h0, h1};
    }
    ll _get_hash(int l, int r,  const vector<ll>& hash, ll B, ll P, const vector<ll>& _bpow) {
        ll res = (hash[r] - hash[l]*_bpow[r - l]) % P;
        res = (res < 0 ? res + P : res);
        assert(res>=0);
        return res;
    }
};
uint64_t rolling_hash::B0 = rng<ll>(1000000, rolling_hash::P0);
uint64_t rolling_hash::B1 = rng<ll>(1000000, rolling_hash::P1);
// snippet:rolling_hash }}}

int solve() {
    string s,t;cin>>s>>t;
    string os = s;

    while(sz(s)<sz(t)){
        s += os;
    }
    int n = sz(s);
    int m = sz(t);

    s += s;
    dump(s);
    dump(t);

    rolling_hash rhs(s);
    rolling_hash rht(t);

    vector<int> ok(n);
    rep(i, n){
        if (rhs.get_hash(i, i+m) == rht.get_hash(0, m)) ok[i] = 1;
    }

    vector<int> dp(n, -1);
    int ans = 0;
    rep(i, n){
        if (ok[i]==0 || dp[i]!=-1) continue;

        set<int> path;
        auto dfs = [&](const auto& dfs, int u) -> int {
            if (dp[u]!=-1) return dp[u];

            if (path.find(u)!=path.end()){
                cout << -1 << endl;
                exit(0);
            }
            else{
                path.insert(u);
            }

            if (ok[(u+m)%n]) {
                dp[u] = dfs(dfs, (u+m)%n) + 1;
            }
            else{
                dp[u] = 1;
            }
            return dp[u];
        };
        chmax(ans, dfs(dfs, i));
    }
    cout << ans << endl;

    return 0; 
}


int main(){/*{{{*/
    solve();
    check_input();
    return 0;
}/*}}}*/


Measured memory_bytes: 137008