#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)

typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, double> Pid;
typedef pair<double, int> Pdi;
typedef pair<ll, int> Pl;
typedef pair<int, pair<int, int>> PP;
constexpr double PI = 3.1415926535897932;   // acos(-1)
constexpr double EPS = 1e-10;
constexpr int INF = 1001001001;
constexpr int mod = 1e+9 + 7;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    string s, t;
    cin >> s >> t;
    int n1 = s.length(), n2 = t.length();
    if(n1 < n2){
        cout << 0 << endl;
        return 0;
    }
    if(n2 == 1){
        for(int i = 0; i < n1; ++i){
            if(s[i] == t[0]){
                cout << -1 << endl;
                return 0;
            }
        }
        cout << 0 << endl;
        return 0;
    }
    int res = 0;
    int pos = 0;
    while(pos <= n1 - n2){
        if(s[pos] == t[0]){
            bool flag = true;
            for(int j = 1; j < n2; ++j){
                if(s[pos + j] != t[j]){
                    flag = false;
                    break;
                }
            }
            if(flag){
                ++res;
                pos += n2 - 1;
            }
            else{
                ++pos;
            }
        }
        else{
            ++pos;
        }
    }
    cout << res << endl;
}