#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

int main() {
  string S, T;
  cin >> S >> T;
  const int n = S.size();
  const int m = T.size();
  if (m == 1 && count(range(S), T[0]) > 0) {
    cout << -1 << endl;
    return 0;
  }
  int ans = 0;
  int i = 0;
  while (i + m <= n) {
    if (S.substr(i, m) == T) {
      ans++;
      i += m - 1;
    } else {
      i++;
    }
  }
  cout << ans << endl;
}