#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
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 V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}


vector< int64_t > divisor(int64_t n) {
  vector< int64_t > ret;
  for(int64_t i = 1; i * i <= n; i++) {
    if(n % i == 0) {
      ret.push_back(i);
      if(i * i != n) ret.push_back(n / i);
    }
  }
  sort(begin(ret), end(ret));
  return (ret);
}


#define fst first
#define snd second
#define all(c) ((c).begin()), ((c).end())

struct knuth_morris_pratt {
  int m;
  const char *p;
  vector< int > fail;

  knuth_morris_pratt(const char *p) : p(p), m(strlen(p)) {
    fail.resize(m + 1, -1);
    for(int i = 1, j = -1; i <= m; ++i) {
      while(j >= 0 && p[j] != p[i - 1]) j = fail[j];
      fail[i] = ++j;
    }
  }

  vector< int > match(const char *s) {
    int n = strlen(s);
    vector< int > occur;
    for(int i = 0, k = 0; i < n; ++i) {
      while(k >= 0 && s[i] != p[k]) k = fail[k];
      if(++k == m) {
        /* match at s[i-m+1 ... i] */
        occur.push_back(i - m + 1);
      }
    }
    return occur;
  }
};

int main() {
  string s, t;
  cin >> s >> t;


  // t のほうがかなり短い場合がやばいだろ

  string S, T(t);
  while(S.size() < T.size()) S += s;


  knuth_morris_pratt QQ(T.c_str());
  auto uku = QQ.match((S + S).c_str());
  vector< int > dp(2 * S.size());
  for(int i = 0; i < uku.size(); i++) {
    chmax(dp[uku[i] + T.size()], dp[uku[i]] + 1);
  }
  int ans = *max_element(begin(dp), end(dp));

  int add = 0;
  for(int i = 0; i < ans; i++) T += t;
  while(S.size() < T.size()) S += s;

  for(;;) {
    knuth_morris_pratt p(T.c_str());
    if(p.match((S + S).c_str()).empty()) {
      break;
    } else {
      add++;
      T += t;
      while(S.size() < T.size()) S += s;
      if(add > 10) {
        cout << -1 << endl;
        return 0;
        break;
      }
    }
  }

  cout << ans + add << endl;
}


Measured memory_bytes: 142552