#include<bits/stdc++.h>

using namespace std;
 
typedef long long int ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
#define pii pair<int, int>

 
const int N = 1e5 + 100;
const int inf = 1e9;
const ll mod =  9302023;

int a[N], b[N], d[N];
int n;
string s[N];


inline void check(int x)
{
	int k = -1;
	for(int i = 0; i < n; i++)
	{
		if(d[i] == 0 && (x*a[i] + b[i]) != 0)
		{
			cout << -1 << endl;
			exit(0);
		}
		if(d[i] == 0)
			continue;
		//cout << i << ' ' << x << ' ' << d[i] << ' ' << k << endl;
		// d[i] != 0
		if((x*a[i] + b[i])%d[i] != 0)
		{
			cout << -1 << endl;
			exit(0);
		}
		if(k == -1)
		{
			k = (x*a[i] + b[i]) / d[i];
			continue;
		}
		if(k != (x*a[i] + b[i]) / d[i])
		{
			cout << -1 << endl;
			exit(0);
		}
	
	}
	if(k == 0 || x == 0)
		cout << -1 << endl;
	else
		cout << x << endl;
	exit(0);
}


int main()
{
	
	cin >> n;
	int k = 0;
	for(int i = 0; i < n; i++)
	{
		cin >> s[i];
		int m = s[i].size();
		
		if(s[i][m-1] == '}')
			k--;
		for(int j = 0; j < m-1; j++)
		{
			if(s[i][j] == 's')
				b[i]++;
			else
				a[i]++;	
		}
		d[i] = k;
		
		if(s[i][m-1] == '{')
			k++;
			
	}
	
	
	for(int i = 0; i < n; i++)
	{
		if(d[i] == 0)
		{
			if(b[i] != 0)
			{
				cout << -1 << endl;
				exit(0);
			}
			if(a[i] != 0)
			{
				check(0);
			}
			continue;
		}
		for(int j = i+1; j < n; j++)
		{
			if(d[j] == 0)
			{
				if(b[j] != 0)
				{
					cout << -1 << endl;
					exit(0);
				}
				if(a[j] != 0)
				{
					check(0);
				}
				continue;
			}

			
			int A = a[i]*d[j], B = b[i]*d[j];
			int A2 = a[j]*d[i], B2 = b[j]*d[i];
			if(A == A2 && B == B2)
				continue;
			if(A == A2)
			{
				cout << -1 << endl;
				exit(0);
			}	
			
			check((B2-B)/(A-A2));
			
		}
	}
		
	cout << 1 << endl;	
		
		
    return 0;
}