#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

int main() {
  string s, t;
  cin >> s >> t;
  int n = s.size(), m = t.size();
  
  if (m == 1) {
    rep(i,n) {
      if (s[i]==t[0]) {
        cout << -1 << endl;
        return 0;
      }
    }
    cout << 0 << endl;
    return 0;
  }

  int ans = 0;
  rep(i,n-m+1) {
    bool flag = true;
    rep(j,m) if (s[i+j] != t[j]) flag = false;
    if (flag) {
      ans++;
      i += m-2;
    }
  }
  cout << ans << endl;


}