#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string s, t;
    cin >> s >> t;
    int n = s.size(), m = t.size();
    vector<int> match(n, false);
    for (int i = 0; i <= n - m; ++i) {
        match[i] = (s.substr(i, m) == t);
    }

    constexpr int INF = 1e9;
    vector<int> dp(n + 1, INF);
    dp[0] = 0;
    for (int i = 1; i <= n; ++i) {
        for (int j = i - 1; j >= 0; --j) {
            if (i - j >= m && match[j]) break;
            if (dp[j] >= INF) continue;
            dp[i] = min(dp[i], dp[j] + (j > 0));
        }
    }
    cout << (dp[n] >= INF ? -1 : dp[n]) << endl;
    return 0;
}