#include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <string>
#include <stdio.h>

using namespace std;

int main() {

	int N;
	string S[105][105];

	cin >> N;
	for (int i = 0; i < N; i++) {
		for(int j = 0; j<N; j++) {
			cin >> S[i][j];
		}
	}

	map<int, int> m;
	int M = -1;

	for (int j = 0; j<N; j++) {
		for (int i = 0; i < N; i++) {
			if (S[i][j] == "nyanpass") {
				m[j]++;
				M = max(M, m[j]);
			}
		}
	}
	int ans = -1;
	bool flag = false;
	map<int, int>::iterator it = m.begin();
	while (it != m.end()) {
		if ((*it).second == M) {
			if (flag) {
				cout << -1 << endl;
				return 0;
			}
			else {
				ans = (*it).first + 1;
				flag = true;
			}
		}
		it++;
	}

	cout << ans << endl;

	return 0;
}