#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define INF (long long)(1e9+7)
#define REP(i,n) for(ll i = 0; i < n; i++)
#define REP1(i,n) for(ll i = 1; i <= n; i++)

int main(void)
{
    string s, t;
    int a = 0, k, cnt = 0 ;
    cin >> s >> t;
    if(t.size() == 1) {
        if(s.find(t)!=string::npos) {
            cout << -1 << endl;
        } else {
            cout << 0 << endl;
        }
        return 0;
    }
    while(1) {
        k = s.find(t, a);
//        cout << s << " " << a << " "<< k << endl;
        if(k != string::npos) {
            cnt ++;
            a = k+t.size()-1;
        } else {
            break;
        }
    }
    cout << cnt << endl;
}