#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint operator^(const ll& t)const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}
	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

///////////////////////////

struct KMP {
	vector<ll> a;//0-index!
	vector<ll> b;

	vector<ll> pma;

	vector<ll> match;

	KMP(vector<ll>a0, vector<ll>b0) {
		a = a0;
		b = b0;

		ll N = a.size();
		ll M = b.size();

		pma.assign(M, 0);

		pma[0] = -1;
		ll j = -1;
		repn(i, M-1) {
			while (j >= 0) {
				if (b[j] == b[i - 1]) { pma[i] = j + 1; j++; break; }
				j = pma[j];
			}

			if (j < 0) { pma[i] = 0; j = 0; }
		
		}

		ll sa = 0;
		ll sb = 0;
		
		while (sa < N) {
			if (a[sa] == b[sb]) {
				if (sb == M - 1) {
					match.push_back(sa - sb);
					if (sb == 0) { sa++; }
					else { sb = pma[sb]; }
				}
				else { sb++; sa++; }
			}

			else {
				if (sb == 0) { sa++; }
				else { sb = pma[sb]; }
			}
		}
	}

	
};


int main() {
	string s, t;
	cin >> s >> t;
	ll N = s.size();
	ll M = t.size();

	vector<ll> a(N + M - 1), b(M);

	rep(i, M) b[i] = t[i];

	rep(i, N + M - 1) a[i] = s[i%N];

	KMP a_b(a, b);

	vector<bool> match(N, 0);
	for (ll i : a_b.match) {
		match[i] = 1;
	}

	//rep(i, N) cout << match[i];
	//cout << endl;


	queue<ll> q;
	vector<ll> top(N, -1);

	rep(i, N) {
		ll j = (i - M) % N;
		if (j < 0) { j += N; }
		if (!match[j]) { q.push(i); top[i] = 0; }
	}

	while (!q.empty()) {
		ll i = q.front();
		q.pop();
		
		if (!match[i]) { continue; }
		ll j = (i + M) % N;

		top[j] = top[i] + 1;
		q.push(j);
	}

	ll ans = 0;
	rep(i, N) {
		if (top[i] == -1) { ans = -1; break; }
		ans = max(ans, top[i]);
	}
	
	cout << ans << endl;

	system("PAUSE");

}

Measured memory_bytes: 46204