#include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<cstdio>
using namespace std;
using ll = long long;
int main(){
  string s, t;
  cin >> s >> t;
  int n = s.length();
  int m = t.length();
  int i = 0;
  int ans = 0;
  if(m == 1){
    for(int i = 0; i < n; i++){
      if(s[i] == t[0]){
        cout << -1 << "\n";
        return 0;
      }
    }
  }

  while(i < n) {
    if(s[i] != t[0]){
      i++;
      continue;
    }else{
      int j = i;
      string tmp;
      tmp = s[j];
      while(j < i + m - 1){
        j++;
        tmp += s[j];
      }
      if(tmp == t){
        ans++;
        i += m - 2;
      }
      i++;
    }
  }
  cout << ans << "\n";
  return 0;
}