#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { string s, t; cin >> s >> t; int n = s.size(); int m = t.size(); if(m == 1){ int flag = 0; rep(i,n){ if(s[i] == t[0]){ cout << -1 << endl; return 0; } } } int ans = 0; rep(i,n){ if(i + m - 1 >= n)break; string u = s.substr(i,m); if(t == u){ ans++; i = i + m - 2; } } cout << ans << endl; return 0; }