#include <bits/stdc++.h>

int main() {
    std::cin.tie(nullptr) -> sync_with_stdio(false);
    
    std::string s, t;
    std::cin >> s >> t;
    
    int n = (int)s.size(), m = (int)t.size();
    
    int ans = 0;
    while (m > 0) {
        std::vector<int> f(m + 1);
        for (int i = 1, j = 0; i < m; i++) {
            while (j && t[i] != t[j]) {
                j = f[j];
            }
            j += (t[i] == t[j]);
            f[i + 1] = j;
        }
        bool match = false;
        for (int i = 0, j = 0; i < n; i++) {
            while (j && s[i] != t[j]) {
                j = f[j];
            }
            j += (s[i] == t[j]);
            if (j == m) {
                match = true;
                break;
            }
        }
        if (match) {
            break;
        }

        int p = -1;
        for (int i = 0; i < m; i++) {
            if (t[i] == 'b') {
                if (p == -1) {
                    p = i % 2;
                } else if (i % 2 != p) {
                    std::cout << -1;
                    exit(0);
                }
            }
        }
        if (p == -1) {
            p = 1;
        }

        std:: string nt;
        int i;
        for (i = p; i < m; i += 2) {
            nt += t[i];
        }

        if (i == m) {
            n = s.size() - 1;
        }

        if (nt == t) {
            std::cout << -1;
            exit(0);
        }

        t = nt;
        m = t.size();
        ans++;
    }

    std::cout << ans;
    return 0;
}