#include<iostream>
#include <algorithm>
#include<string>
#include <bitset>
#include <vector>
#include <functional>
#include <climits>
using namespace std;
int main()
{
	//int a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, ans = 0;
	long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, ans = 0;
	//cout << LONG_MAX << endl;
	string s[1001];
	//long long n, A[1000000000];
	int n;
	cin >> n;
	for ( a = 0; a < n; a++)
	{
		cin >> s[a];
	}
	int num[1001] = {};
	for ( a = 0; a < n; a++)
	{
		c = 0;
		for ( b = 0; b < s[a].length(); b++)
		{
			if (s[a][b]=='^')
			{
				c++;
			}
		}
		num[c]++;
	}
	b = 0;
	c = 0;
	for ( a = 0; a < 1001; a++)
	{
		if (b<=num[a])
		{
			b = num[a];
			c = a;
		}
	}

	cout << c << endl;
	return 0;
}