#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;

template<long long MOD>
struct ModInt{

    using ll = long long;
    ll val;

    void setval(ll v) { val = v % MOD; };
    ModInt(): val(0) {}
    ModInt(ll v) { setval(v); };

    ModInt operator+(const ModInt &x) const { return ModInt(val + x.val); }
    ModInt operator-(const ModInt &x) const { return ModInt(val - x.val + MOD); }
    ModInt operator*(const ModInt &x) const { return ModInt(val * x.val); }
    ModInt operator/(const ModInt &x) const { return *this * x.inv(); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt operator+=(const ModInt &x) { return *this = *this + x; }
    ModInt operator-=(const ModInt &x) { return *this = *this - x; }
    ModInt operator*=(const ModInt &x) { return *this = *this * x; }
    ModInt operator/=(const ModInt &x) { return *this = *this / x; }

    friend ostream& operator<<(ostream &os, const ModInt &x) { os << x.val; return os; }
    friend istream& operator>>(istream &is, ModInt &x) { is >> x.val; x.val = (x.val % MOD + MOD) % MOD; return is; }

    ModInt pow(ll n) const {
        ModInt a = 1;
        if(n == 0) return a;
        int i0 = 64 - __builtin_clzll(n);
        for(int i = i0 - 1; i >= 0; i--){
            a = a * a;
            if((n >> i) & 1) a *= (*this); 
        }
        return a;
    }
    ModInt inv() const { return this->pow(MOD - 2); }
};

using mint = ModInt<mod>; mint pow(mint x, long long n) { return x.pow(n); }
//using mint = double; //for debug
using mvec = vector<mint>;
using mmat = vector<mvec>;

const mint r = 114514;
mint invr;

mvec calcrephash(string &s, int n){
    mint c = 1, h = 0;
    REP(i, SZ(s)){
        h += (mint)s[i] * c;
        c *= r;
    }
    mvec rephash(n + 1, 0);
    c = 1;
    mint r0 = r.pow(SZ(s));
    REP(i, n){
        rephash[i + 1] = rephash[i] + h * c;
        c *= r0;
    }
    return rephash;
}

mvec calchash(string &s){
    mvec hash(SZ(s) + 1, 0);
    mint c = 1;
    REP(i, SZ(s)){
        hash[i + 1] = hash[i] + (mint)s[i] * c;
        c *= r;
    }
    return hash;
}


mvec powr1, powr2, powinvr;
mint calch0(string &s, mvec &rephash, mvec &hash, int i, int N, int l){
    if(i + N <= SZ(s)) return (hash[i + N] - hash[i]) * invr.pow(i);
    else{
        mint h0 = (hash[SZ(s)] - hash[i]) * powinvr[i];//invr.pow(i);
        int n = (N - (SZ(s) - i)) / SZ(s), k = (N - (SZ(s) - i)) % SZ(s);
        h0 += rephash[n] * powr1[SZ(s) - i];//r.pow(SZ(s) - i);
        h0 += hash[k] * powr2[l] * powinvr[k];//r.pow(N - k);
        return h0;
    }
}

signed main(){

    string s, t; cin >> s >> t;
    int n = SZ(s), m = SZ(t);

    mvec rephash_s = calcrephash(s, m + 1), rephash_t = calcrephash(t, n + 1);
    mvec hash_s = calchash(s), hash_t = calchash(t);
    invr = r.inv();
    
    powr1.resize(n + 1);
    powr2.resize(n + 1);
    powinvr.resize(n + 1);
    mint r2 = r.pow(m);
    powr1[0] = 1, powr2[0] = 1, powinvr[0] = 1;
    REP(i, n){
        powr1[i + 1] = powr1[i] * r;
        powr2[i + 1] = powr2[i] * r2;
        powinvr[i + 1] = powinvr[i] * invr;
    }

    int ans = 0;
    REP(i, n){
        if(calch0(s, rephash_s, hash_s, i, m * n, n).val == rephash_t[n].val){
            Out(-1);
            return 0;
        }else{
            int k0 = 0, k1 = n;
            while(k1 - k0 > 1){
                int k = (k0 + k1) / 2;
                if(calch0(s, rephash_s, hash_s, i, m * k, k).val == rephash_t[k].val) k0 = k;
                else k1 = k;
            }
            Max(ans, k0);
        }
    }
    Out(ans);

    return 0;
}


Measured memory_bytes: 31132