#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;
  int n = (int)s.size(), m = (int)t.size();
  if (n < m) {
    cout << "0\n";
    return 0;
  }
  if (m == 1) {
    for (int i = 0; i < n; i++) {
      if (s[i] == t[0]) {
        cout << "-1\n";
        return 0;
      }
    }
  }
  auto res = z_algorithm(s+t);
  int cur = 0, ans = 0;
  for (int i = 0; i < res.size(); i++) {
    if (cur <= res[i]) {
      cur = res[i] + m - 1;
      ans++;
    }
  }
  cout << ans << endl;
  return 0;
}