#include<iostream>
#include<string>
#include<algorithm>
using namespace std;


string s, t;

int main() {
	cin >> s >> t;
	int n, m;
	n = s.size(), m = t.size();
	
	if (m == 1) {
		bool f = 1;
		for (int i = 0; i < n; i++)f &= (s[i] != t[0]);
		if (!f) {
			cout << -1 << endl;
			return 0;
		}
	}
	int ans = 0;
	for (int i = 0; i < n; i++) {

		if (i + m - 1 >= n)
			continue;

		bool f = 1;
		for (int j=0; j < m; j++) {
			f &= (s[i+j] == t[j]);
		}
		if (f) {
			ans++;
			i += m - 2;
		}
	}

	cout << ans << endl;
	
	return 0;
}