#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (N) ; i++)
#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define vrep(v,it) for(auto it = v.begin(); it != v.end(); it++)
#define vrepr(v,it) for(auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; using vl = vector<ll>;
using vi = vector<int>; using vvi = vector< vector<int> >;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif

//using P = pair<unsigned int,unsigned int>; using vp = vector<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
/////////////////
constexpr unsigned int rh_mod = 1333331333;
constexpr unsigned int rh_b[] = { 1333133303 , 1145141999 };
constexpr int rh_sz = 2;
struct RH{
  using P = pair<unsigned int , unsigned int>;
  vector< vector< unsigned int> > hashed, power;
  RH(const string &s){
    int size_ = (int)s.size();
    hashed.resize(rh_sz , vector<unsigned int>(size_ + 1 , 0));
    power.resize(rh_sz , vector<unsigned int>(size_ + 1 , 0));
    rep(i , rh_sz) power[i][0] = 1;
    rep(i , rh_sz) rep(j , size_){
      power[i][j + 1] = ((unsigned long long)power[i][j] * rh_b[i]) % rh_mod;
      hashed[i][j + 1]= ((unsigned long long)hashed[i][j] * rh_b[i] + s[j] ) % rh_mod;
      //trc(i , j , power[i][j + 1] , hashed[i][j + 1]);
    }
  }
  
  P get(int l,int r) const{
    unsigned int ret[rh_sz];
    rep(i , rh_sz)
      ret[i] = ( hashed[i][r] + rh_mod - (unsigned int)( (long long)hashed[i][l] * power[i][r-l] % rh_mod ) ) % rh_mod;
    return P(ret[0] , ret[1]);
  }
};
pair<unsigned int , unsigned int> get_hash(const string &S){
  unsigned int ret[rh_sz];
  rep(i , rh_sz){
    unsigned long long cur = 0;
    rep(j , sz(S)){
      cur = (cur * rh_b[i] + S[j]) % rh_mod;
    }
    ret[i] = cur;
  }
  return pair<unsigned int , unsigned int>(ret[0] , ret[1]);
}

void solve(){
  ins(SS,T);
  int N = sz(SS) , M = sz(T);
  string S;
  while(sz(S) < N + M){
    S += SS;
  }
  vvi g(N);
  RH rh(S);
  auto th = get_hash(T);
  int ans = 0;
  vi visited(N , 0);
  rep(i , N){
    if(visited[i]) continue;
    int cur = 0 , idx = i; visited[i] = 1;
    while(rh.get(idx , idx + M) == th){
      idx = (M + idx) % N; cur++; visited[idx] = 1;
      if(idx == i) die(-1);
    }
    amax(ans , cur);
  }
  out(ans);


}

Measured memory_bytes: 43876