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

inline vector<int> z_algorithm(const string &s) {
  int n = (int)s.length();
  vector<int> z(n);
  z[0] = n;
  for (int i = 1, l = 0, r = 0; i < n; i++) {
    if (i <= r) z[i] = min(r - i + 1, z[i - 1]);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) z[i]++;
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}

int main() {
  string s, t;
  cin >> s >> t;
  if (t.size() == 1) {
    if (s.find(t[0]) != string::npos) {
      cout << "-1\n";
    }
    else {
      cout << "0\n";
    }
    return 0;
  }

  string u = s + t;
  auto vec = z_algorithm(u);
  int ans = 0;
  for (int i = t.size(); i < u.size(); i++) {
    if (vec[i] >= t.size()) {
      ans++;
      i += t.size() - 2;
    }
  }
  cout << ans << '\n';
  return 0;
}