#include<stdio.h>
#include<algorithm>
#define maxN 515
#define Inf 1 << 28
#define i64 long long
using namespace std;

FILE*f=fopen("zone.in","r");
FILE*g=fopen("zone.out","w");

int L1,L2,C1,C2,N,Nr,i,j,p,u,Viz[11],ok,m;
i64 S[maxN][maxN],V[11],W[11];
int s1,s2,s3;

int cautbin1 ( ){
	p = 1; u = N - 2;
	
	while ( p <= u ){
		m = (p + u) >> 1; 
		if ( S[L1][ m ] == V[s1] )
			return m;
		if ( S[L1][ m ] < V[s1] )
			p = m + 1;
		else
			u = m - 1;
		
	}
	return 0;
}

int cautbin2 (  ){
	p = C1 + 1; u = N - 1;
	
	while ( p <= u ){
		m = (p + u) >> 1; 
		if ( S[L1][m] - S[L1][C1] == V[s3] )
			return m;
		if ( S[L1][m] - S[L1][C1] < V[s3] )
			p = m + 1;
		else
			u = m - 1;
	}
	return 0;
	
}

int cautbin3 (){
	p = L1 + 1; u = N - 1;
	
	while ( p <= u ){
		m = (p + u) >> 1; 
		if ( S[m][C1] - S[L1][C1] == V[s2] )
			return m;
		if ( S[m][C1] - S[L1][C1] < V[s2] )
			p = m + 1;
		else
			u = m - 1;
	}		
	return 0;
	
}

void Solutie () {
	
	W[1] = V[s1]; W[4] = V[s2]; W[2] = V[s3];
	W[3] = S[L1][N] - W[1] - W[2]; W[5] = S[L2][C2] - W[1] - W[2] - W[4];
	W[6] = S[L2][N] - W[5] - W[4] - W[3] - W[2] - W[1];
	W[7] = S[N][C1] - W[4] - W[1]; W[8] = S[N][C2] - W[1] - W[2] - W[4] - W[5] - W[7];
	W[9] = S[N][N] - W[1] - W[2] - W[3] - W[4] - W[5] - W[6] - W[7] - W[8] ;
	
	sort(W+1,W+10);
	int ok2 = 0;
	for ( int i = 1 ; i <= 9 ; ++i ){
		if ( V[i] != W[i] )
			ok2 = 1;
	}
	if( !ok2 )
		ok = 1;
	
}

void solve () {
	
	for ( L1 = 1 ; L1 < N - 1 && !ok ; ++L1 ){
		for ( s1 = 1 ; s1 <= 9 && !ok ; ++s1 ){
			C1 = cautbin1();
			if ( !C1 )	continue;
			Viz[s1] = 1;
			for ( s2 = 1 ; s2 <= 9 && !ok ; ++s2 ){
				if ( Viz[s2] )	continue;
				L2 = cautbin3();
				if ( !L2 )	continue;
				Viz[s2] = 1;
				for ( s3 = 1 ; s3 <= 9 && !ok ; ++s3 ){
					if ( Viz[s3] ) continue;
					C2 = cautbin2();
					if ( !C2 )	continue;
					Solutie();
					if ( ok ){
						fprintf(g,"%d %d %d %d\n",L1,L2,C1,C2);
					}
					
				}
				Viz[s2] = 0;
			}
			Viz[s1] = 0;
		}
	}
	
}

int main () {
	fscanf(f,"%d",&N);
	
	for ( i = 1 ; i <= 9 ; ++i ){
		fscanf(f,"%d",&V[i]);
	}
	sort(V+1,V+10);
	
	for ( i = 1 ; i <= N ; ++i ){
		for ( j = 1 ; j <= N ; ++j ){
			fscanf(f,"%lld",&Nr);
			S[i][j] = S[i-1][j] + S[i][j-1] - S[i-1][j-1] + Nr;
		}
	}
	
	solve() ;
	
	fclose(f);
	fclose(g);
	
	return 0;
}