// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < int(n); i++)
#define rep1(i,n) for (int i = 1; i <= int(n); i++)
#define repR(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = int(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char*) { cerr << endl; }
template <class T, class... U> void dump_impl(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; dump_impl(s, y...); }
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
using ll = long long;
using ld = long double;
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; }
template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
template <size_t i, class T> typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream&, T const&) { }
template <size_t i = 0, class T> typename enable_if<i < tuple_size<T>::value>::type
output_tuple(ostream& os, T const& t) { os << (i ? " " : "") << get<i>(t); output_tuple<i+1,T>(os,t); }
template <class... T> ostream& operator<<(ostream& os, tuple<T...> const& t) { return output_tuple(os,t), os; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
#define int ll
#define double ld
template <class T> int sz(T const& x) { return x.size(); }
const ll INF = (1LL<<62)-1; // ~ 4.6e18
// <<<
// >>> z-algorithm
template <class str>
vector<int> z_alg(str const& s) {
    const int n = s.size();
    vector<int> z(n); z[0] = n;
    for (int i = 1, l = 0, r = 1; i < n; ++i) {
        if (i < r) z[i] = min(r-i, z[i-l]);
        while (i+z[i] < n && s[z[i]] == s[i+z[i]]) ++z[i];
        if (r <= i+z[i]) l=i, r=i+z[i];
    }
    return z;
}

template <class str>
vector<int> z_search(str const& s, str const& p) {
    str t(p.size()+s.size(),0);
    rep (i,p.size()) t[i] = p[i];
    rep (i,s.size()) t[p.size()+i] = s[i];
    auto z = z_alg(t);
    vector<int> ret;
    rep (i,s.size()) if (z[p.size()+i] >= (int)p.size()) ret.push_back(i);
    return ret;
}
// <<<
// >>> scc

constexpr int dst(int v) { return v; }
template <class E, class = decltype(E().to)>
constexpr int dst(E const& e) { return e.to; }

template <class E> struct SCC {
    vector<vector<E> > const& g;
    vector<int32_t> ord, low, st;
    int32_t time = 0, pos = 0, sz = 0;
    SCC(vector<vector<E> > const& g) : g(g), ord(g.size()), low(g.size()), st(g.size()) {
        rep (v,g.size()) if (ord[v] == 0) dfs(v);
        for (auto &x : ord) x += sz;
    }
    void dfs(int v) {
        low[v] = ord[v] = ++time; st[pos++] = v;
        for (auto const& e : g[v]) {
            if (ord[dst(e)] == 0) {
                dfs(dst(e));
                chmin(low[v], low[dst(e)]);
            } else if (ord[dst(e)] > 0) {
                chmin(low[v], ord[dst(e)]);
            }
        }
        if (low[v] == ord[v]) {
            sz++; do ord[st[--pos]] = -sz; while (st[pos] != v);
        }
    }
    int size() const { return sz; }
    int id(int v) const { return ord[v]; }
    vector<vector<int> > groups() const {
        vector<vector<int> > grp(sz);
        rep (v,g.size()) grp[ord[v]].push_back(v);
        return grp;
    }
};
template <class E> auto get_scc(vector<vector<E> > const& g) { return SCC<E>(g); }

// <<<

int32_t main() {
    string s,t; cin >> s >> t;
    int n = sz(s), m = sz(t);

    string ss = s;
    rep (i,(n+m-1)/n) ss += s;
    auto v = z_search(ss,t);
    dump(ss);
    dump(v);

    vector<vector<int> > g(n);
    for (int i : v) {
        if (i >= n) break;
        int nxt = (i+m)%n;
        if (i == nxt) quit(-1);
        g[i].eb(nxt);
    }

    auto scc = get_scc(g);
    dump(scc.size());
    if (scc.size() < n) quit(-1);

    vector<int> dp(n,-1);
    def (rec, int x) -> int {
        int &res = dp[x];
        if (res >= 0) return res;
        if (g[x].empty()) return res = 0;
        res = 0;
        for (int y : g[x]) chmax(res, rec(y));
        res++;
        return res;
    };
    rep (i,n) rec(i);
    dump(dp);

    cout << *max_element(all(dp)) << endl;



}


Measured memory_bytes: 64816