#include <iostream>
#include <vector>
#include <string>
#include <utility>
#include <algorithm>
#include <climits>
#include <map>
#include <queue>

using namespace std;

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

    if (t.size() == 1 && s.find(t)!=string::npos) {
        cout << -1 << endl;
        return 0;
    }

    const int n = s.size();
    const int c = t.size();
    int ans = 0;
    for (int i=0; i<n; i++) {
        if (t == s.substr(i, c)) ans++, i+=c-2;
    }
    cout << ans << endl;
}