#include <bits/stdc++.h>
using namespace std;
#define Int long long
//#define int long long
//TEMPLATE START---------------8<---------------8<---------------8<---------------8<---------------//
typedef long long ll;       typedef long double ld;  typedef pair<int,int> pii; typedef pair<ll,ll> pll;  typedef vector<int> vi;   typedef vector<ll> vl;
typedef vector<string> vst; typedef vector<bool> vb; typedef vector<ld> vld;    typedef vector<pii> vpii; typedef vector<pll> vpll; typedef vector<vector<int> > vvi;
const int INF = (0x7FFFFFFFL); const ll INFF = (0x7FFFFFFFFFFFFFFFL); const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int MOD = 1e9 + 7;       const int MODD = 998244353;            const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const double PI = acos(-1.0);  const double EPS = 1e-9;               const string Alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
int dx[9] = { 1, 0, -1,  0,  1, -1, -1, 1, 0 };
int dy[9] = { 0, 1,  0, -1, -1, -1,  1, 1, 0 };
#define ln '\n'
#define scnaf scanf
#define sacnf scanf
#define sancf scanf
#define SS(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t){cin >> t;}template<typename First, typename...Rest> void MACRO_VAR_Scan(First& first, Rest&...rest){cin >> first;MACRO_VAR_Scan(rest...);}
#define SV(type,c,n) vector<type> c(n);for(auto& i:c)cin >> i;
#define SVV(type,c,n,m) vector<vector<type>> c(n,vector<type>(m));for(auto& r:c)for(auto& i:r)cin >> i;
template<class T,class U>ostream &operator<<(ostream &o,const pair<T,U>&j){o<<"{"<<j.first<<", "<<j.second<<"}";return o;}
template<class T,class U>ostream &operator<<(ostream &o,const map<T,U>&j){o<<"{";for(auto t=j.begin();t!=j.end();++t)o<<(t!=j.begin()?", ":"")<<*t;o<<"}";return o;}
template<class T>ostream &operator<<(ostream &o,const set<T>&j){o<<"{";for(auto t=j.begin();t!=j.end();++t)o<<(t!=j.begin()?", ":"")<<*t;o<<"}";return o;}
template<class T>ostream &operator<<(ostream &o,const vector<T>&j){o<<"{";for(int i=0;i<(int)j.size();++i)o<<(i>0?", ":"")<<j[i];o<<"}";return o;}
inline int print(void){cout << endl; return 0;}
template<class Head> int print(Head&& head){cout << head;print();return 0;} template<class Head,class... Tail> int print(Head&& head,Tail&&... tail){cout<<head<<" ";print(forward<Tail>(tail)...);return 0;}
inline int debug(void){cerr << endl; return 0;}
template<class Head> int debug(Head&& head){cerr << head;debug();return 0;} template<class Head,class... Tail> int debug(Head&& head,Tail&&... tail){cerr<<head<<" ";debug(forward<Tail>(tail)...);return 0;}
template<typename T> void PA(T &a){int ASIZE=sizeof(a)/sizeof(a[0]);for(int ii=0;ii<ASIZE;++ii){cout<<a[ii]<<" \n"[ii==ASIZE-1];}}
template<typename T> void PV(T &v){int VSIZE=v.size();for(int ii=0;ii<VSIZE;++ii){cout<<v[ii]<<" \n"[ii==VSIZE-1];}}
#define ER(x)  cerr << #x << " = " << (x) << endl;
#define ERV(v) {cerr << #v << " : ";for(const auto& xxx : v){cerr << xxx << " ";}cerr << "\n";}
inline int YES(bool x){cout<<((x)?"YES":"NO")<<endl;return 0;} inline int Yes(bool x){cout<<((x)?"Yes":"No")<<endl;return 0;}  inline int yes(bool x){cout<<((x)?"yes":"no")<<endl;return 0;}
inline int yES(bool x){cout<<((x)?"yES":"nO")<<endl;return 0;} inline int Yay(bool x){cout<<((x)?"Yay!":":(")<<endl;return 0;}
template<typename A,typename B> void sankou(bool x,A a,B b){cout<<((x)?(a):(b))<<endl;}
#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,n,0)
#define RREPI(i,a,b) for(ll i=ll(a);i>=ll(b);--i)
#define RREP(...) _overload3(__VA_ARGS__,RREPI,_RREP,)(__VA_ARGS__)
#define EACH(e,v) for(auto& e : v)
#define PERM(v) sort((v).begin(),(v).end());for(bool c##p=1;c##p;c##p=next_permutation((v).begin(),(v).end()))
#define ADD(a,b) a=(a+ll(b))%MOD
#define MUL(a,b) a=(a*ll(b))%MOD
inline ll MOP(ll x,ll n,ll m=MOD){ll r=1;while(n>0){if(n&1)(r*=x)%=m;(x*=x)%=m;n>>=1;}return r;}
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}inline ll lcm(ll a,ll b){return a*b/gcd(a,b);}inline ll POW(ll a,ll b){ll c=1ll;do{if(b&1)c*=1ll*a;a*=1ll*a;}while(b>>=1);return c;}
template<typename T,typename A,typename B> inline bool between(T x,A a,B b) {return ((a<=x)&&(x<b));}template<class T> inline T sqr(T x){return x*x;}
template<typename A,typename B> inline bool chmax(A &a,const B &b){if(a<b){a=b;return 1;}return 0;}
template<typename A,typename B> inline bool chmin(A &a,const B &b){if(a>b){a=b;return 1;}return 0;}
#define tmax(x,y,z) max((x),max((y),(z)))
#define tmin(x,y,z) min((x),min((y),(z)))
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define SORT(v) sort((v).begin(),(v).end())
#define RSORT(v) sort((v).rbegin(),(v).rend())
#define EXIST(s,e) (find((s).begin(),(s).end(),(e))!=(s).end())
#define EXISTST(s,c) (((s).find(c))!=string::npos)
#define POSL(x,val) (lower_bound(x.begin(),x.end(),val)-x.begin())
#define POSU(x,val) (upper_bound(x.begin(),x.end(),val)-x.begin())
#define GEQ(x,val) (int)(x).size() - POSL((x),(val))
#define GREATER(x,val) (int)(x).size() - POSU((x),(val))
#define LEQ(x,val) POSU((x),(val))
#define LESS(x,val) POSL((x),(val))
#define SZV(a) int((a).size())
#define SZA(a) sizeof(a)/sizeof(a[0])
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MEMINF(a) memset(a,0x3f,sizeof(a))
#define FILL(a,b) memset(a,b,sizeof(a))
#define UNIQUE(v) sort((v).begin(),(v).end());(v).erase(unique((v).begin(),(v).end()),(v).end())
struct abracadabra{
  abracadabra(){
    cin.tie(0); ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
    cerr << fixed << setprecision(5);
  };
} ABRACADABRA;

//TEMPLATE END---------------8<---------------8<---------------8<---------------8<---------------//

template<int mod, int base=10007>
struct RollingHash {
    vector<ll> hsh, pwr;
    ll umod(ll n) { return (n % mod + mod) % mod; }
    RollingHash() {}
    RollingHash(const string &s) {
        int sz = (int)s.size();
        hsh.assign(sz * 2 + 10, 0);
        pwr.assign(sz * 2 + 10, 0);  pwr[0] = 1;
        for (int i = 0; i < sz * 2; ++i) {
            if (sz > i) hsh[i + 1] = umod(hsh[i] * base + s[i]);
            pwr[i + 1] = umod(pwr[i] * base);
        }
    }
    // [l, r)
    ll get(int l, int r) {
        return umod(hsh[r] - hsh[l] * pwr[r - l]);
    }
    // h1 <- h2
    ll join(ll h1, ll h2, int h2_sz) {
        return umod(h1 * pwr[h2_sz] + h2);
    }
};
// using RH1 = RollingHash<107>;
// using RH2 = RollingHash<109>;
using RH1 = RollingHash<(int)1e9 + 7>;
using RH2 = RollingHash<MODD>;
using RH = pair<RH1, RH2>;
using H = pair<ll, ll>;
RH init(const string &s) { return make_pair(RH1(s), RH2(s)); }
H get(RH &rh, int l, int r) { return make_pair(rh.first.get(l, r), rh.second.get(l, r)); }
// [0, n) [n, last)
H rotate(RH &rh, int n, int sz) {
    int h2_sz = n;
    H ret;
    {
        ret.first = rh.first.join(rh.first.get(n, sz), rh.first.get(0, n), h2_sz);
        // print(n, sz, rh.first.get(n, sz));
    }
    {
        ret.second = rh.second.join(rh.second.get(n, sz), rh.second.get(0, n), h2_sz);
    }
    return ret;
}

signed main() {

    // string s = "baabaa";
    // RH rh = init(s);
    // print(get(rh, 3, 6));

    SS(string, S, T);

    int S_sz = S.size();
    int S_sz_tmp = 2 * S_sz;
    int T_sz = T.size();

    bool flag = true;
    REP(i, T_sz) {
        if (T[i] == T[0]) continue;
        flag = false;
        break;
    }
    if (flag && S[0] == T[0]) {
        REP(i, S_sz) {
            if (S[i] == S[0]) continue;
            flag = false;
            break;
        }
        if (flag) {
            print(-1);
            return 0;
        }
        // else {
        //     S += S;
        //     RH S_rh = init(S);
        //     RH T_rh = init(T);
        //     for (int i = 0; i < T_sz; ++i) {
        //         for (int j = i; j < S_sz; j += T_sz) {
        //         if (get(S_rh, i, i + T_sz))
        //     }
        //     return 0;
        // }
    }

    // may be -1
    if (S_sz % T_sz == 0 || T_sz % S_sz == 0) {
        int T_sz_tmp = T_sz;
        string new_T = T;
        while (T_sz_tmp < S_sz) {
            new_T += T;
            T_sz_tmp += T_sz;
        }

        int S_sz_tmp = S_sz;
        string new_S = S;
        while (S_sz_tmp < T_sz) {
            new_S += S;
            S_sz_tmp += S_sz;
        }

        RH S_rh = init(new_S);
        RH T_rh = init(new_T);

        // print(new_S, new_T);
        // print(get(S_rh, 0));

        if (get(S_rh, 0, S_sz_tmp) == get(T_rh, 0, T_sz_tmp)) return print(-1);

        REP(i, 1, S_sz_tmp) {
            // print(get(S_rh, 0, S_sz_tmp), rotate(T_rh, i, T_sz_tmp));
            if (get(S_rh, 0, S_sz_tmp) == rotate(T_rh, i, T_sz_tmp)) return print(-1);
        }
    }

    string S_many = S + S;

    while (S_sz_tmp < T_sz * 3) {
        S_sz_tmp += S_sz;
        S_many += S;
    }

    ll res = 0;

    REP(k, 2) {
        
        if (k == 1) S_many += S_many;

        RH S_rh = init(S_many);
        RH T_rh = init(T);
        int sz = S_many.size();

        // mid個繋げたとき
        function<int(int)> check = [&](int mid) {
            ll res = 0;
            REP(i, T_sz) {
                bool ok = false;
                ll ret = 0;
                ll cnt = 0;
                for (int j = i; j < sz; j += T_sz) {
                    if (j + T_sz > sz) break;
                    if (get(S_rh, j, j + T_sz) == get(T_rh, 0, T_sz)) {
                        if (ok) {
                            ++cnt;
                        } else {
                            ok = true;
                            cnt = 1;
                        }
                    } else {
                        ok = false;
                        chmax(ret, cnt);
                        cnt = 0;
                    }
                }
                chmax(ret, cnt);
                chmax(res, ret);
            }
            return res;
        };

        if (k == 0) {
            res = check(0);
        } else {
            if (res != check(0)) return print(-1);
            print(res);
        }
    }

    // int MAX = int(S_many.size()) / int(T.size()) + 1;
    // {
    //     ll ok = 0, ng = MAX;
    //     while (abs(ok - ng) > 1) {
    //       ll mid = (ok + ng) / 2;
    //       if (check(mid)) {
    //         ok = mid;
    //       } else {
    //         ng = mid;
    //       }
    //     }
    // }

    // print(check(0));

}


Measured memory_bytes: 288268