#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 

typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;

char str0[1005];
char str1[1005];

void solve()
{
    scanf("%s%s", str0, str1);
    int n0=strlen(str0);
    int n1=strlen(str1);
    if(n0<n1) {
        printf("0\n"); return;
    }
    if(n1==1) {
        int i;
        for (i = 0; i < n0; i++) {
            if (str0[i] == str1[0]) {
                printf("-1\n"); return;
            }
        }
        printf("0\n");
        return;
    }

    int cnt=0;
    int i;
    for (i = 0; i < n0; i++) {
        int j=i+n1;
        if(j>n0) break;

        if(strncmp(&str0[i], str1, n1)==0) {
            cnt++;
            i=i+n1-2;
        }
    }
    printf("%d\n", cnt);

    return;
}


int main(int argc, char* argv[])
{
#if 1
	solve();
#else
	int T; scanf("%d", &T);
	while (T--) {
		solve();
	}
#endif
	return 0;
}