#ifdef LOCAL111
#else
	#pragma GCC optimize ("O3")
	#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const long long INF = 1e17;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

typedef long long cost_t;

class Edge {
public:
	int to = -1;
	cost_t cost = -1;
	
	Edge(){
	}

	Edge(int x,cost_t y){
		to = x;
		cost = y;
	}

	// Edge(int x, int y, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// }

	// Edge(int x, int y, int r, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// 	// rev = r;
	// }

	bool operator< (const Edge& x) const {
		if(cost != x.cost) return cost < x.cost;
		return to < x.to;
	}

	bool operator> (const Edge& x) const {
		if(cost != x.cost) return cost > x.cost;
		return to > x.to;
	}
};

class Graph {
private:
	typedef vector<Edge> Edges;
	//const long long int INF = (long long)1e18;
	vector<Edges> v; 
	int n;
public:
	Graph(int x){
		n = x;
		v = vector<Edges>(x);
	}

	Graph(){}

	Edges& operator[](int x){
		return v[x];
	}

	const Edges& operator[](int x) const {
		return v[x];
	}

	int size() const {
		return n;
	}

	void add_edge(int from, const Edge &e){
		v[from].push_back(e);
	}

	void add_edge(int from, int to, cost_t cost = -1){
		add_edge(from,Edge(to,cost));
	}

	// void add_edge(int from, int to, cost_t cost = -1, int rev = -1){
	// 	add_edge(from,Edge(from,to,rev,cost));
	// }

	void add_uedge(int from, int to, cost_t cost = -1){
		add_edge(from,to,cost);
		add_edge(to,from,cost);
	}
};

//library
random_device rnd;
mt19937 MT(rnd());

int randInt(int from, int to) {
	uniform_int_distribution<int> rand(from, to - 1);
	return rand(MT);
}

long long randInt(long long from, long long to){
	uniform_int_distribution<long long> rand(from, to-1);
	return rand(MT);
}
//library

//library
/*
10015727
10015739
10015783
10015801
10015813
10015847
*/
const int prime = 10015727;
template<typename T>
struct RollingHash {
private:
	using element_type = int;
	int m;
	int b;
public:
	RollingHash(int prime){
		m = prime;
		b = randInt(2,prime);
	}

	size_t operator()(T x){
		hash<element_type> hasher;
		long long t = 1;
		long long res = 0;
		for(auto&& e : x) {
			res = (res+t*hasher(e))%m;
			t = t*b%m;
		}
		return res;
	}
};

template<long long MOD>
class ModInt {
public:
	const static long long mod = MOD;
	long long x;
	
	ModInt() {
		x = 0;
	}

	ModInt(long long x) {
		x %= mod;
		this->x = x < 0 ? x+mod : x;
	}

	int get() const {
		return (int)x;
	}

	ModInt &operator+=(ModInt that) {
		if((x += that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator-=(ModInt that) {
		if((x += mod-that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator*=(ModInt that) {
		x = x*that.get()%mod;
		return *this;
	}

	ModInt &operator/=(ModInt that) {
		return *this *= that.inverse();
	}

	ModInt operator+(ModInt that) const {
		return ModInt(*this) += that;
	}

	ModInt operator-(ModInt that) const {
		return ModInt(*this) -= that;
	}

	ModInt operator*(ModInt that) const {
		return ModInt(*this) *= that;
	}

	ModInt operator/(ModInt that) const {
		return ModInt(*this) /= that;
	}

	ModInt inverse() const {
		using std::swap;
		long long a = x, b = mod, u = 1, v = 0;
		while(b) {
			long long t = a/b;
			a -= t*b; swap(a,b);
			u -= t*v; swap(u,v);
		}
		return ModInt(u);
	}

	ModInt pow(int n) const{
		ModInt b = *this;
		ModInt res = 1;
		while(n != 0) {
			if(n&1){
				res *= b;
			}
			b *= b;
			n >>= 1;
		}
		return res;
	}

	bool operator==(ModInt that) const { return x == that.get(); }
	bool operator!=(ModInt that) const { return x != that.get(); }
	ModInt operator-() const { return x == 0 ? 0 : ModInt(mod-x); }
};

template<long long MOD> ostream& operator<< (ostream& os, const ModInt<MOD>& m) { os << m.get(); return os; }
template<long long MOD> istream& operator>> (istream& is, ModInt<MOD>& m){ long long n; is >> n; m = n; return is;}
typedef ModInt<1000000007> mint0;
typedef ModInt<1000000009> mint1;


//liblary

tuple<vector<int>,int> getSCCDecomposition(const Graph &g)
{
	int n = g.size();
	vector<bool> used(n,false);
	vector<int> cmp(g.size());
	Graph rg(n);
	for(int i = 0; i < n; ++i) {
		for(auto&& e : g[i]) {
			rg.add_edge(e.to,i,e.cost);
		}
	}
	vector<int> vs;
	vs.reserve(g.size());
	
	function<void(int)> dfs = [&](int v){
		used[v] = true;
		for(auto&& e : g[v]) {
			if(!used[e.to]) dfs(e.to);
		}
		vs.push_back(v);
	};

	function<void(int,int)> rdfs = [&](int v, int k){
		used[v] = true;
		cmp[v] = k;
		for(auto&& e : rg[v]) {
			if(!used[e.to]) rdfs(e.to,k); 
		}
	};

	for(int v = 0; v < n; ++v) {
		if(!used[v]) dfs(v);
	}
	fill(used.begin(), used.end(), false);
	int k = 0;
	for(int i = n-1; i >= 0; --i) {
		if(!used[vs[i]]) rdfs(vs[i], k++);
	}
	return make_tuple(cmp,k);
}

Graph getSCCGraph(const Graph &g, vector<int> cmp, int k){
	Graph res(k);
	for(int p = 0; p < (int)g.size(); ++p) {
		for(auto&& e : g[p]) if(cmp[p] != cmp[e.to]){
			res.add_edge(cmp[p],Edge(cmp[e.to],e.cost));
		}
	}
	return res;
}

//liblary


class GraphVizualizer{
	int cnt;
public:
	GraphVizualizer(){
		cnt = 0;
	}

	void operator() (const Graph &g, bool with_dir = true, bool with_cap = false){
		ofstream ofs("./out.dot");
		if(!with_dir) ofs << "graph graph_name {" << endl;
		else ofs << "digraph graph_name {" << endl;
		for(int i = 0; i < (int)g.size(); ++i) {
			ofs << "    " << i << "[];" << endl;
		}
		for(int i = 0; i < (int)g.size(); i++){
			if (!g[i].size())
				continue;
			for(const auto &e : g[i]){
				if(!with_dir){
					if(e.to > i) ofs << "    " << i << " -- " << e.to ; 
				}else ofs << "    " << i << " -> " << e.to ; 
				
				if (with_cap) {
					ofs << " [ label = \"" << (e.cost  == INF ? "inf" : to_string(e.cost)) << "\"];"; 
				}
				if(with_dir or e.to > i)ofs << endl;
			}
		}
		ofs << "}" << endl;
		ofs.close();
		string cmd = "dot -T png out.dot > ";
		cmd = cmd+"sample"+to_string(cnt)+".png";
		system(cmd.c_str());	
		cnt++;
	}
};

//library

class UFTree {
//private:
public:
	vector<int> par;
	vector<int> rank;
	vector<int> num;

//public:
	UFTree(int n)
	{
		par = vector<int>(n);
		rank = vector<int>(n);
		num = vector<int>(n);
		for(int i = 0; i < n; i++){
			par[i] = i;
			rank[i] = 0;
			num[i] = 1;
		}
	}

	int find(int x)
	{
		if(par[x] == x){
			return x;
		}else{
			return par[x] = find(par[x]);
		}
	}

	void unite(int x, int y)
	{
		x = find(x);
		y = find(y);
		if(x == y) return;
		if(rank[x] < rank[y]){
			par[x] = y;
			num[y] += num[x];
		}else{
			par[y] = x;
			num[x] += num[y];
			if(rank[x] == rank[y])	rank[x]++;
		}
	}

	int count(int x)
	{
		return num[find(x)];
	}

	bool same(int x, int y)
	{
		return find(x) == find(y);
	}
};
//library

int main()
{
	ios_init();
	string s, t;
	// GraphVizualizer viz;
	while(cin >> s >> t) {
		// string ss = s;
		// while(SZ(ss) <= SZ(t) + SZ(s)) {
		// 	ss += s;
		// }
		// ss += s;
		using H = tuple<mint0, mint1, mint0>;
		const LL m0 = 1000000007;
		const LL m1 = 1000000009;
		const LL d = 7;
		const LL d2 = 13;
		
		H tha;
		{
			mint0 h0 = 0;
			mint1 h1 = 0;
			mint0 h2 = 0;
			REP(i, SZ(t)) {
				h0 *= d;
				h1 *= d;
				h2 *= d2;

				h0 += t[i];
				h1 += t[i];
				h2 += t[i];
			}
			tha = H(h0, h1, h2);
		}

		mint0 h0 = 0;
		mint1 h1 = 0;
		mint0 h2 = 0;
		REP(i, SZ(t)) {
			h0 *= d;
			h1 *= d;
			h2 *= d2;

			h0 += s[i % SZ(s)];
			h1 += s[i % SZ(s)];
			h2 += s[i % SZ(s)];
		}
		Graph g(SZ(s));
		mint0 dpo0 = mint0(d).pow(SZ(t) - 1);
		mint1 dpo1 = mint1(d).pow(SZ(t) - 1);
		mint0 dpo2 = mint0(d2).pow(SZ(t) - 1);
		bool ex = true;
		REP(i, SZ(s)) {
			if(H(h0, h1, h2) == tha) {
				DEBUG(i); DEBUG((i + SZ(t)) % SZ(s));
				if(i == (i + SZ(t)) % SZ(s)) {
					ex = false;
				}
				g.add_edge(i, (i + SZ(t)) % SZ(s), -1);
			}
			h0 -= dpo0 * s[i];
			h1 -= dpo1 * s[i];
			h2 -= dpo2 * s[i];

			h0 *= d;
			h1 *= d;
			h2 *= d2;

			h0 += s[(i + SZ(t)) % SZ(s)];
			h1 += s[(i + SZ(t)) % SZ(s)];
			h2 += s[(i + SZ(t)) % SZ(s)];
		}

		vector<int> cmp;
		int k;
		tie(cmp, k) = getSCCDecomposition(g);
		auto sg = getSCCGraph(g, cmp, k);
		// viz(g);
		vector<int> cnt(k);
		REP(i, SZ(cmp)) cnt[cmp[i]]++;

		REP(i, SZ(cnt)) if(cnt[i] > 1) {
			ex = false;
		}
		if(ex) {
			// vector<int> dp(SZ(sg), -2);
			// function<void(int)> rec = [&](int p) {
			// 	if(dp[p] != -2) return;
			// 	for(auto&& e : sg[p]) {
			// 		rec(e.to);
			// 	}
			// 	if(cnt[p] > 1) {
			// 		dp[p] = -1;
			// 	} else {
			// 		int ma = 0;
			// 		for(auto&& e : sg[p]) {
			// 			chmax(ma, dp[e.to]);
			// 		}
			// 		if(dp[p] != -1) {
			// 			dp[p] = ma + 1;
			// 		}
			// 	}
			// };
			// REP(i, SZ(sg)) rec(i);
			// dpite(ALL(dp));
			// int ans = 0;
			// REP(i, SZ(dp)) {
			// 	chmax(ans, dp[i]);
			// }
			// cout << ans - 1 << endl;
			UFTree uft(SZ(g));
			REP(i, SZ(g)) {
				for(auto&& e : g[i]) {
					uft.unite(i, e.to);
				}
			}
			int ans = 0;
			REP(i, SZ(g)) {
				chmax(ans, uft.count(i));
			}
			cout << ans - 1 << endl;
		} else {
			cout << -1 << endl;
		}
	}
	return 0;
}


Measured memory_bytes: 93084