#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;

//#define int long long
//using ll = boost::multiprecision::cpp_int;
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr int dx[4]={1,0,-1,0};
constexpr int dy[4]={0,1,0,-1};
#ifdef LOCAL_ENV
	#define debug(var) std::cout<<#var" = "<<var<<std::endl
#else
	#define debug(var)
#endif
#define p(var) std::cout<<var<<std::endl
#define rep(i, n)	 for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define all(a) (a).begin(), (a).end()
#define PI (acos(-1))
template<typename T> inline T power(T x, T n){ return n ? power(x*x%MOD,n/2)*(n%2?x:1)%MOD : 1; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a,	b) * b; }
template<typename T1, typename T2>inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2>inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template<typename T1, typename T2> ostream& operator<<(ostream& s, const pair<T1, T2>& p) {return s << "(" << p.first << ", " << p.second << ")";}
template<typename T> ostream& operator<<(ostream& s, const vector<T>& v) {
	for (int i = 0, len = v.size(); i < len; ++i){
		s << v[i]; if (i < len - 1) s << "\t";
	}
	return s;
}
template<typename T> ostream& operator<<(ostream& s, const vector< vector<T> >& vv) {
	for (int i = 0, len = vv.size(); i < len; ++i){
		s << vv[i] << endl;
	}
	return s;
}
template<typename T1, typename T2> ostream& operator<<(ostream& s, const map<T1, T2>& m) {
	s << "{" << endl;
	for (typeof(m.begin()) itr = m.begin(); itr != m.end(); ++itr){
		s << "\t" << (*itr).first << " : " << (*itr).second << endl;
	}
	s << "}" << endl;
	return s;
}

/*-----8<-----8<-----*/

//文字列Sが与えられた時、各 i について「S と S[i:|S|-1] の最長共通接頭辞の長さ」の配列を返す
vector<ll> zalgorithm(const string &s) {
	vector<ll> ans(s.size());
	ans[0] = s.size();
	int i = 1, j = 0;
	while (i < s.size()) {
		while (i + j < s.size() && s[j] == s[i+j]) ++j;
		ans[i] = j;
		if (!j) {
			++i;
			continue;
		}
		int k = 1;
		while (i + k < s.size() && k + ans[k] < j) ans[i+k] = ans[k], ++k;
		i += k;
		j -= k;
	}
	return ans;
}

signed main() {
	//ABC135F
	string S,SS,T;
	cin>>S>>T;
	SS=S;
	while(SS.size()<S.size()+T.size())SS+=S;

	vector<ll> z=zalgorithm(T+"#"+SS);

	vector<ll> indegree(S.size());
	vector<vector<ll>> g(S.size());
	for(auto it=z.begin()+T.size()+1; it!=z.begin()+T.size()+1+S.size(); it++){
		if(*it==T.size()){
			ll i=it-z.begin()-T.size()-1;
			ll to=(i+T.size()) % S.size();
			g[i].push_back(to);
			indegree[to]++;
		}
	}

	queue<ll> q;
	rep(i,S.size()) if(indegree[i]==0)q.push(i);
	
	vector<ll> dp(S.size(),0);
	ll sortcount=0;
	while(!q.empty()){
		ll v=q.front();
		q.pop();
		sortcount++;
		for(ll nextv : g[v]){
			dp[nextv]=dp[v]+1;
			indegree[nextv]--;
			if(indegree[nextv]==0)q.push(nextv);
		}
	}

	if(sortcount==S.size()){
		ll maxval=0;
		rep(i,S.size())chmax(maxval,dp[i]);
		p(maxval);
	}else{
		p(-1);
	}
	
	return 0;
}


Measured memory_bytes: 53520