#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T &a,T b){if(a>b)a=b;}
constexpr int INF=1000000000000000000;
constexpr int mod=1000000007;
constexpr double eps=1e-12;
const double pi=acos(-1);
//int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int Random(int mi,int ma){
    random_device rnd;
    mt19937 mt(rnd());//32bit
    //[mi,ma]
    uniform_int_distribution<int>engine(mi,ma);
    return engine(mt);
}
int gcd(int a,int b){
    if(b==0)return a;
    return gcd(b,a%b);
}
int lcm(int a,int b){
    return a/gcd(a,b)*b;
}
bool prime(int a){
    if(a==1)return false;
    for(int i=2;i*i<=a;i++){
        if(a%i==0)return false;
    }
    return true;
}
int modpow(int a,int b){
    if(b==0)return 1;
    if(b%2)return modpow(a,b-1)*a%mod;
    int memo=modpow(a,b/2);
    return memo*memo%mod;
}
vector<int>kaijo,invkaijo;
void init_fact(int n){
    kaijo.resize(n+1);
    invkaijo.resize(n+1);
    kaijo[0]=1;
    for(int i=1;i<=n;i++){
        kaijo[i]=kaijo[i-1]*i;
        kaijo[i]%=mod;
    }
    rep(i,n+1)invkaijo[i]=modpow(kaijo[i],mod-2);
}
int comb(int a,int b){
    if(a<b)return 0;
    if(a<0||b<0)return 0;
    return kaijo[a]*modpow(kaijo[a-b],mod-2)%mod*modpow(kaijo[b],mod-2)%mod;
}
int inv(int x){
    x=modpow(x,mod-2);
    return x;
}
struct RollingHash{
    const int MASK30=(1ul<<30)-1;
    const int MASK31=(1ul<<31)-1;
    const int MOD=(1ul<<61)-1;
    int Base=9973;
    vector<int>hash,power;
    int calcmod(int x){
        int res=(x>>61)+(x&MOD);
        if(res>=MOD)res-=MOD;
        return res;
    }
    int mul(int a,int b){
		int au=a>>31;
		int ad=a&MASK31;
		int bu=b>>31;
		int bd=b&MASK31;
		int mid=ad*bu+au*bd;
		int midu=mid>>30;
		int midd=mid&MASK30;
		return calcmod(au*bu*2+midu+(midd<<31)+ad*bd);
	}
    RollingHash(string s,int base){
        //Base=Random(1<<7,1<<9)
        Base=base;
        int n=s.size();
        hash.resize(n+1,0);
        power.resize(n+1,1);
        rep(i,n){
            hash[i+1]=(mul(hash[i],Base)+s[i])%MOD;
            power[i+1]=mul(power[i],Base)%MOD;
        }
    }
    int get_hash(int l,int r){
        //[l,r)
        return (hash[r]-mul(hash[l],power[r-l])+MOD)%MOD;
    }
    int lcp(int x,int y){
        //Longest Common Prefix
        int len=min(hash.size()-y,hash.size()-x);
        int ok=0,ng=len+1;
        while(ng-ok>1){
            int mid=(ok+ng)/2;
            if(get_hash(x,x+mid)==get_hash(y,y+mid))ok=mid;
            else ng=mid;
        }
        return ok;
    }
};
int to[500010];
bool used[500010],in[500010],flag;
signed main(){
    cin.tie(0);ios::sync_with_stdio(false);
    string s,t;
    cin>>s>>t;
    int n=s.size();
    string s_=s;
    while(s_.size()<t.size()*4)s_+=s_;
    s=s_;
    RollingHash RHs(s+s,9973),RHt(t,9973),RHs2(s+s,99991),RHt2(t,99991);
    fill(to,to+n,-1);
    rep(i,n){
        if(RHs.get_hash(i,i+t.size())==RHt.get_hash(0,t.size())&&RHs2.get_hash(i,i+t.size())==RHt2.get_hash(0,t.size())){
            to[i]=(i+t.size())%n;
            in[(i+t.size())%n]=true;
            flag=true;
        }
    }
    if(!flag){
        puts("0");
        return 0;
    }
    int ans=-1;
    rep(i,n){
        if(!in[i]&&!used[i]){
            int x=i,d=0;
            while(1){
                used[x]=true;
                chmax(ans,d);
                if(to[x]!=-1){
                    if(used[to[x]]){
                        puts("-1");
                        return 0;
                    }
                    d++;
                    x=to[x];
                }
                else break;
            }
        }
    }
    cout<<(ans?ans:-1)<<endl;
    return 0;
}


Measured memory_bytes: 278728