#include<cstdio>
#include<vector>
#include<cassert>
#include<algorithm>
using namespace std;

#define debug if(0)


typedef long long LL;
const int N5 = 50015;
int card[N5];
int perm[N5];
int inv[N5];
int n;
bool color[N5];

int card_cycle[N5];
int card_pos_in_cycle[N5];

typedef vector<pair<int,int> >cykl; //pozycja, po ilu ruchach

vector<cykl>cykle;

void create_cycle(int v){
	cykl res;
	int act = 0;
	while(1){
		if(!color[v]) break;
		color[v] = false;

		int CARD = card[v];
		card_pos_in_cycle[CARD] = act;
		card_cycle[CARD] = (int)cykle.size();

		res.push_back(pair<int,int> (v, act++));
		//printf("v %d act %d\n",v,act);
		v = inv[v];
	}
	debug {
		for(int i=0; i<res.size(); i++) printf("(%d, %d) ", res[i].first, res[i].second);
		printf("\n");
	}
	sort(res.begin(), res.end());
	cykle.push_back(res);
}

struct kiedy{
	int fst;
	int c;
	kiedy(int _f=-1, int _c=-1):fst(_f),c(_c){}
};

kiedy kiedyf(int karta, int pos){
	kiedy res;

	cykl &CYKL = cykle[card_cycle[karta]];

	int p = lower_bound(CYKL.begin(), CYKL.end(), pair<int,int>(pos, 0)) - CYKL.begin();
	if(p==(int)CYKL.size()  || CYKL[p].first!=pos) {
		return kiedy(-1,-1);
	}

	int fst = CYKL[p].second - card_pos_in_cycle[karta];
	if(fst<0) fst+=CYKL.size();
	return kiedy(fst, CYKL.size());
}

int PROP[5];

LL A[5],B[5]; // x=A[i] mod B[i]

/** CHINCZYK **/
LL GCD(LL a, LL b){
	LL tmp;
	while(b!=0){
		tmp = b;
		b = a % b;
		a = tmp;
	}
	return a;
}

LL eGCD(LL a, LL b, LL &x, LL &y){
	if(b==0){
		x = 1;
		y = 0;
		return a;
	}
	LL d = eGCD(b,a%b,y,x);
	y = a-x*(a/b)-y;
	x = b-x;
	return d;
}

LL inverse(LL a, LL p){LL x,y; eGCD(a%p+p, p, x, y); return x%p; }

bool crt_error;

LL CRT(LL a, LL m, LL b, LL n){
	b = (b+n-(a%n))%n;
	LL d = GCD(m,n);
	if(b%d!=0){
		crt_error = true;
		return 0;
	}
	LL old_m = m;
	m/=d; b/=d; n/=d;
	return ((b*inverse(m,n))%n)*old_m+a;
}

LL NWW(LL a, LL b){
	LL res = a, d = GCD(a,b);
	res/=d;
	res*=b;
	return res;
}

LL chinczyk(){
	crt_error = false;

	LL x;
	for(int i=1; i<5; i++){
		x = CRT(A[0], B[0], A[i], B[i]);
		if(crt_error) return -1;
		A[0] = x;
		B[0] = NWW(B[0],B[i]);
	}

	return x;
}
/** CHINCZYK **/

void solve(){
	int act = 0;
	for(int i=0; i<n; i++){
		perm[5*i+0] = act++;
		perm[5*i+1] = act++;
	}
	for(int i=0; i<n; i++){
		perm[5*i+2] = act++;
		perm[5*i+3] = act++;
	}
	for(int i=0; i<n; i++){
		perm[5*i+4] = act++;
	}
	for(int i=0; i<5*n; i++) inv[perm[i]] = i;

	debug {for(int i=0; i<5*n; i++) printf("%d ",perm[i]); printf("\n"); }

	for(int i=0; i<5*n; i++) color[i]=true;

	for(int i=0; i<5*n; i++){
		if(color[i]) {
			create_cycle(i);
		}
	}

	LL BEST = -1;
	int player;
	kiedy KIEDY;
	for(int i=0; i<n; i++){
		PROP[0] = 5*i+0;
		PROP[1] = 5*i+1;
		PROP[2] = 5*i+2;
		PROP[3] = 5*i+3;
		PROP[4] = 5*i+4;
		do{
			bool ok = true;
			for(int k=0; k<5; k++){
				KIEDY = kiedyf(k+1, PROP[k]);
				if(KIEDY.fst==-1){ok = false; break;}

				A[k] = KIEDY.fst;
				B[k] = KIEDY.c;
			}

			if(ok){
				debug {
					printf("\nPROP:\n");
					for(int k=0; k<5; k++){
						printf("karta %d na %d : %lld %lld\n",k+1, PROP[k], A[k], B[k]);
					}
				}

				LL tmp = chinczyk();
				if(tmp>=0){
					debug printf("PLAYER %d : %lld\n", i+1, tmp);
					if(BEST==-1 || tmp<BEST){
						player = i+1;
						BEST = tmp;
					}
				}
			}
		}while (next_permutation(PROP, PROP+5));
	}

	if(BEST==-1){
		printf("Neverending game.\n");
	} else {
		printf("Player %d wins game number %lld.\n",player,BEST);
	}
	cykle.clear();
}

main(){
	while(1){
		scanf("%d",&n);
		if(n==0) break;
		for(int i=0; i<5*n; i++) {
			scanf("%d",&card[i]);
		}
		solve();
	}
	return 0;
}