#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define N 200005

void solve()
{
    int n;
    cin >> n;
    vector<string> a(n + 1);
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int j = 1; j <= 1e3; j++)
    {
        bool is = 1;
        int tab = -1, cnt = 0;
        for (int i = 2; i < n; i++)
        {
            int s = 0, t = 0;
            for (char c : a[i])
            {
                if (c == 's')
                    s++;
                else if (c == 't')
                    t++;
            }
            if (a[i].back() == '{')
                cnt++;
            int z = j * cnt;
            if (s > z || (t > 0 && (z - s) % t))
            {
                is = 0;
                break;
            }
            if (t > 0)
            {
                if (tab == -1)
                    tab = (z - s) / t;
                else if (tab != (z - s) / t)
                {
                    is = 0;
                    break;
                }
            }
            if (a[i].back() == '}')
                cnt--;
        }
        if (is)
        {
            cout << tab << '\n';
            return;
        }
    }
    cout << -1;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}