#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;


int main(void){
    string s,t;
    cin>>s>>t;
    int n = s.size();
    int m = t.size();
    if(m==1){
        for(int i=0;i<n;i++){
            if(s[i]==t[0]){
                cout<<-1<<endl;
                return 0;
            }
        }
        cout<<0<<endl;
        return 0;
    }
    int ans = 0;
    for(int i=0;i<=n-m;){
        string u = s.substr(i,m);
        //cout<<u<<endl;
        if(u==t){
            ans++;
            i+=m;
        }
        else i++;
    }
    cout<<ans<<endl;
    return 0;

}