#ifdef DEBUG_IS_VALID
#define DEB 1 
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif

#include <bits/stdc++.h>
using namespace std;

#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i, x, n) for(int i = x; i >= n; i--)
#define rrep(i, n) RREP(i,n,0)
#define pb push_back
#pragma GCC optimize ("-O3")

using namespace std;

#define DUMPOUT cout
#define dump(...) if(DEB) DUMPOUT<<"  "<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl<<"    "; if(DEB) dump_func(__VA_ARGS__)
template<typename T1,typename T2>ostream& operator << (ostream& os, pair<T1,T2> p){cout << "(" << p.first << ", " << p.second << ")"; return os;}
template<typename T>ostream& operator << (ostream& os, vector<T>& vec) { os << "{"; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "}"; return os; }
template<typename T>ostream& operator << (ostream& os, set<T>& st){cout << "{"; for(auto itr = st.begin(); itr != st.end(); itr++) cout << *itr << (next(itr)!=st.end() ? ", " : ""); cout << "}"; return os;}
template<typename T1,typename T2>ostream& operator << (ostream& os, map<T1,T2> mp){cout << "{"; for(auto itr = mp.begin(); itr != mp.end(); itr++) cout << "(" << (itr->first) << ", " << (itr->second) << ")" << (next(itr)!=mp.end() ? "," : ""); cout << "}"; return os; }

void dump_func(){DUMPOUT << endl;}
template <class Head, class... Tail>void dump_func(Head&& head, Tail&&... tail){ DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...);}
template<class T> inline bool chmax(T& a,T const& b){if(a>=b) return false; a=b; return true;}
template<class T> inline bool chmin(T& a,T const& b){if(a<=b) return false; a=b; return true;}

using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<Pl>;
using vvp = vector<vp>;

const int INF = 1<<29;
const long long LINF=1LL<<59;

vector<int> topological_sort(const vector<vector<int>>& graph){
  // if graph is not DAG, return {}
  // else topological sorted vertices
  int N = graph.size();
  stack<int> st;
  vector<int> h(N), res;
  for(int i = 0; i < N; i++)
    for(auto& v: graph[i]) h[v]++;
  for(int i = 0; i < N; i++)
    if(h[i] == 0) st.push(i);
  while(st.size()) {
    int u = st.top(); st.pop();
    res.push_back(u);
    for(auto& v: graph[u]){
      h[v]--;
      if(h[v] == 0) st.push(v);
    }
  }
  if(res.size() != N) res.clear();
  return res;
}

class RollingHash
{
  using ull = unsigned long long;
  ll N;
  const ull MASK30 = (1UL << 30) - 1;
  const ull MASK31 = (1UL << 31) - 1;
  const ull MOD = (1UL << 61) - 1;
  const ull POSITIVIZER = MOD * ((1UL << 3) - 1);
  static ull Base;
  static vector<ll> powMemo;
  vector<ull> dat;
public:
  void init(){
    if(powMemo.size() < N) {
      ll from = powMemo.size();
      powMemo.resize(N);
      powMemo[0] = 1;
      for (int i = from; i < N; i++) if(i != 0)
        powMemo[i] = CalcMod(Mul(powMemo[i - 1], Base));
    }
  }
  RollingHash(){}
  RollingHash(string s): N(s.size()), dat(s.size()+1)
  {
    init();
    for (int i = 0; i < N; i++)
      dat[i + 1] = CalcMod(Mul(dat[i], Base) + s[i]);
  }

  ull hash(int l, int r)
  {
    return CalcMod(dat[r] + POSITIVIZER - Mul(dat[l], powMemo[r-l]));
  }

  bool match(int l1, int r1, int l2, int r2){
    return hash(l1, r1) == hash(l2, r2);
  }

  ull Mul(ull l, ull r)
  {
    long long lu = l >> 31;
    long long ld = l & MASK31;
    long long ru = r >> 31;
    long long rd = r & MASK31;
    long long middleBit = ld * ru + lu * rd;
    return ((lu * ru) << 1) + ld * rd + ((middleBit & MASK30) << 31) + (middleBit >> 30);
  }

  ull CalcMod(ull val)
  {
    val = (val & MOD) + (val >> 61);
    if (val > MOD) val -= MOD;
    return val;
  }
};
std::mt19937 engine(chrono::steady_clock::now().time_since_epoch().count());
unsigned long long RollingHash::Base = engine();
vector<long long> RollingHash::powMemo = {};

void abc_135_f(){
  // https://atcoder.jp/contests/abc135/submissions/6797213
  string S,T;
  cin >> S >> T;
  ll N, M;
  N = S.size(); M = T.size();
  ll sz = 2 * max(M,N);
  string W(sz, ' ');
  rep(i,sz) W[i] = S[i%N];
  RollingHash rh1(W), rh2(T);
  vvi g(N);
  auto h2 = rh2.hash(0,M);
  rep(i,N){
    auto h1 = rh1.hash(i,i+M);
    if(h1 == h2) g[i].pb((i+M)%N);
  }
  dump(g);
  auto ts = topological_sort(g);
  if(ts.size() != N){
    cout << -1 << endl;
    return;
  }
  vl dp(N);
  for(auto u:ts){
    for(auto v:g[u]) chmax(dp[v], dp[u]+1LL);
  }
  cout << *max_element(ALL(dp)) << endl;
}

int main(){
  abc_135_f();
  return 0;
}


Measured memory_bytes: 51592