#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i,n) for(int i=0;i<n;i++)

const ll mod = ll(1e9) + 7;
const int INF = 1<<29;

int main(){
    string s,t;
    cin >> s >> t;
    if (s.find(t)!=-1 && t.size()==1){
        cout << "-1" << endl;
        return 0;
    }
    int ans = 0;
    int pos = s.find(t);
    while (pos != -1){
        ans++;
        pos = s.find(t,pos+t.size());
    }
    cout << ans << endl;
    return 0;
}