#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define endl '\n'
const int inf = 1e9 + 7;
const ll INF = 1e18;
int mod = 998244353;
// int mod = 1000000007;
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll pow(ll a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }
ll modpow(ll a, ll b, ll _mod) { return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1; }
template<class T, class U> ostream& operator << (ostream& os, const pair<T, U>& p) { os << p.F << " " << p.S; return os; }
template<class T> ostream& operator << (ostream& os, const vector<T>& vec) { rep(i, sz(vec)) { if (i) os << " "; os << vec[i]; } return os; }
template<typename T> inline istream& operator >> (istream& is, vector<T>& v) { rep(j, sz(v)) is >> v[j]; return is; }
template<class T, class T2> inline void add(T &a, T2 b) { a += b; if (a >= mod) a -= mod; }


void solve();

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(10);

  int T;
  // cin >> T;
  T = 1;

  while (T--) {
    solve();
  }
}

using pll = pair<ll, ll>;
class RollingHash {
  static const ll base1 = 1009;
  static const ll base2 = 2009;
  static const ll mod1 = 1000000007;
  static const ll mod2 = 1000000009;
  static const int N = 2000000;
  ll hash1[N], hash2[N], pow1[N], pow2[N];

public:
  RollingHash(const string &S) {
    int n = sz(S);
    rep(i, n) {
      hash1[i] = hash2[i] = 0;
      pow1[i] = pow2[i] = 1;
    }
    rep(i, n) {
      hash1[i + 1] = (hash1[i] * base1 + S[i]) % mod1;
      hash2[i + 1] = (hash2[i] * base2 + S[i]) % mod2;
      pow1[i + 1] = (pow1[i] * base1) % mod1;
      pow2[i + 1] = (pow2[i] * base2) % mod2;
    }
  }

  // S の [l, r) のハッシュ値を返す
  inline pll get(int l, int r) const {
    ll res1 = hash1[r] - hash1[l] * pow1[r - l] % mod1;
    if (res1 < 0) res1 += mod1;
    ll res2 = hash2[r] - hash2[l] * pow2[r - l] % mod2;
    if (res2 < 0) res2 += mod2;
    return make_pair(res1, res2);
  }
};

void solve() {
  string s, t;
  cin >> s >> t;
  using pll = pair<ll, ll>;
  string u = s;
  while (sz(u) < sz(t)) u += s;
  u += u;
  RollingHash U(u), T(t);
  vector<int> v(sz(u));
  pll ht = T.get(0, sz(t));
  vector<int> G(sz(u), -1);
  rep(i, sz(u)) {
    pll hu = U.get(i, i + sz(t));
    if (hu == ht) {
      G[i] = (i + sz(t)) % sz(s);
    }
  }
  int ans = 0;
  vector<int> used(sz(s));
  rep(i, sz(s)) {
    int now = i;
    if (used[now]) continue;
    int cnt = 0;
    while (1) {
      used[now] = 1;
      now = G[now];
      if (now == -1) break;
      cnt++;
      if (cnt == sz(s)) {
        cout << -1 << endl;
        return;
      }
    }
    chmax(ans, cnt);
  }
  cout << ans << endl;
}


Measured memory_bytes: 108488