#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long int lint;
int main() {
	int N;
	cin >> N;
	if (N > 1) {
		vector<string>veca(N);
		for (int ia = 0; ia < N; ia++) {
			cin >> veca.at(ia);
		}
		vector<int>vecb(N + 1);
		int cnt = 0;
		for (int ib = 0; ib < N; ib++) {
			for (int ic = 0; ic < veca.at(ib).size(); ic++) {
				if (veca.at(ib).at(ic) == '^') {
					cnt++;
				}
			}
			vecb.at(ib) = cnt;
			cnt = 0;
		}
		sort(vecb.begin(), vecb.end());
		reverse(vecb.begin(), vecb.end());
		int J = 0;
		int j = 1;
		for (int id = 0; id < N; id++) {
			if (vecb.at(id) == vecb.at(id + 1)) {
				j++;
			}
			else {
				J = max(J, j);
				j = 1;
			}
		}
		int cntb = 1;
		int i = 0;
		while (cntb != J) {
			if (vecb.at(i) == vecb.at(i + 1)) {
				cntb++;
			}
			i++;
		}
		cout << vecb.at(i - 1) << endl;
	}
	else {
		int ans = 0;
		string S;
		cin >> S;
		for (int ig = 0; ig < S.size(); ig++) {
			if (S.at(ig) == '^') {
				ans++;
			}
		}
		cout << ans << endl;
	}
}