#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
using namespace std;

//#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vecy[4] = {0,-1,0,1};
const int Vecx[4] = {1,0,-1,0};


int main(){
	int n;
	string in;
	bool check[100];
	int cnt;
	for(int i=0; i<100; i++){
		check[i] = true;
	}
	
	cin >> n;
	for(int iy=0; iy<n; iy++){
		for(int ix=0; ix<n; ix++){
			cin >> in;
			if(in != "nyanpass" && in != "-"){
				check[ix] = false;
			}
		}
	}
	
	
	cnt = count(check, check + n, true);
	if(cnt != 1){
		cout << -1 << endl;
	}else{
		cout << find(check, check + n, true) - check + 1 << endl;
	}
    
    return 0;
}