#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

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

    int n = s.size();
    int m = t.size();

    int r = 0;
    for (int i = 0;;) {
        auto j = s.find(t, i);
        if (j == string::npos) break;
        if (m == 1) {
            cout << -1 << endl;
            exit(0);
        }
        r++;
        i = j + m - 1;
    }

    cout << r << endl;

    return 0;
}