#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    string s, t;
    cin >> s >> t;
    if (t.size() == 1) {
        if (all_of(s.begin(), s.end(), [&](char c) { return c == t[0]; })) {
            cout << -1 << endl;
            return 0;
        }
    }
    int32_t ans = 0;
    size_t pos = 0;
    while (pos + t.size() <= s.size()) {
        bool matches = true;
        for (auto i = size_t(0); i < t.size(); ++i) {
            if (s[pos + i] != t[i]) {
                matches = false;
                break;
            }
        }
        if (matches) {
            ++ans;
            pos = pos + t.size() - 1;
        } else {
            ++pos;
        }
    }
    cout << ans << endl;
    return 0;
}