#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cerr << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cerr<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; //use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

namespace SCC {
	int n;
	vi G[MAX_N], rG[MAX_N];
	vi nG[MAX_N];//if you don't want to create a new graph, comment out
	vi vs;
	bool used[MAX_N];
	int cmp[MAX_N]; // cycle number that nodes are in, topological order
	//for scc:
	//cmp[i] == cmp[i + N] impossible
	//cmp[i] > cmp[i + N] vi is true
	//cmp[i] < cmp[i + N] vi is false
	vi C[MAX_N];//this too. all nodes in cycle

	void init(int N) {
		n = N;
		rep(i, 0, n) {
			G[i].clear();
			rG[i].clear();
			nG[i].clear();
			C[i].clear();
		}
	}

	void add_edge(int from, int to) {
		G[from].push_back(to);
		rG[to].push_back(from);
	}

	void dfs(int v) {
		used[v] = true;
		rep(i, 0, (int)G[v].size()) {
			int n = G[v][i];
			if(!used[n]) dfs(n);
		}
		vs.push_back(v);
	}

	void rdfs(int v, int k) {
		used[v] = true;
		cmp[v] = k;
		//* //C
		C[k].push_back(v);
		//*/
		rep(i, 0, (int)rG[v].size()) {
			int n = rG[v][i];
			if(!used[n]) rdfs(n, k);
			//* //nG
			if(used[n] && cmp[n] < k) nG[cmp[n]].push_back(k);
			//*/
		}
	}

	int get() {
		memset(used, 0, sizeof(used));
		vs.clear();
		rep(v, 0, n) {
			if(!used[v]) dfs(v);
		}
		memset(used, 0, sizeof(used));
		fill(cmp, cmp + n, n);
		int k = 0;
		rer(i, (int)vs.size(), 0) {
			if(!used[vs[i]]) rdfs(vs[i], k++);
		}
		//* //C
		rep(i, 0, k) reverse(all(C[i]));
		//*/
	
		//* //nG
		rep(i, 0, k) {
			sort(all(nG[i]));
			nG[i].erase(unique(all(nG[i])), nG[i].end());
		}
		//*/
		return k;
	}
}

vector<int> KMP(string S) {
	int n = (int)S.size();
	S += '_';
	vector<int> A(n + 1);
	A[0] = -1;
	int j = -1;
	rep(i, 0, n) {
		while (j >= 0 && S[i] != S[j]) j = A[j];
		j++;
		if(S[i + 1] == S[j]) A[i + 1] = A[j];
		else A[i + 1] = j;
	}
	return A;
}

int N, M;
string str, T;
string S;
int d[MAX_N];

int loop(int v) {
	if(d[v] != -1) return d[v];
	d[v] = 0;
	rep(i, 0, sz(SCC::G[v])) {
		int n = SCC::G[v][i];
		MAX(d[v], loop(n) + 1);
	}
	return d[v];
}

void solve() {
	cin >> str >> T;
	N = sz(str); M = sz(T);
	S += str;
	S += str;
	while(sz(S) - M + 1 < N) S += str;
	vector<int> kmp = KMP(T);
	int at = 0;

	SCC::init(N);
	rep(i, 0, sz(S)) {
		while(at >= 0 && S[i] != T[at]) at = kmp[at];
		at++;
		if(at == M && i - M + 1 < N) {
			int from = (i - M + 1) % N;
			int to = (i + 1) % N;
			if(from == to) {
				cout << -1 << "\n"; return;
			}
			SCC::add_edge(from, to);
			// debug(from, to);
			at = kmp[at];
		}
	}
	int K = SCC::get();
	debug(K);
	if(K != N) {
		cout << -1 << "\n";
	}
	else {
		memset(d, -1, sizeof(d));
		int ans = 0;
		rep(i, 0, N) {
			MAX(ans, loop(i));
		}
		cout << ans << "\n";
	}
}

uint32_t rd() {
	uint32_t res;
#ifdef __MINGW32__
	asm volatile("rdrand %0" :"=a"(res) ::"cc");
#else
	res = std::random_device()();
#endif
	return res;
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
    cerr << fixed;
	cerr.precision(6);
	rng.seed(rd());
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
	if(!freopen("in.txt", "rt", stdin)) return 1;
#endif	
	solve();
    cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
	return 0;
}



Measured memory_bytes: 140328