#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;


int main(){
    string s,t; cin >> s >> t;
    int n = s.size();
    int m = t.size();
    bool ok = false;
    rep(i,n-m+1){
        if(s.substr(i,m) == t) ok = true;
    }
    if(!ok){
        cout << 0 << endl;
        return 0;
    }
    if(ok && m == 1){
        cout << -1 << endl;
        return 0;
    }
    int ans = 0;
    rep(i,n-m+1){
        if(s.substr(i,m) == t){
            ans++;
            i += m-2;
        }
    }
    cout << ans << endl;
}