#include<fstream>
#include<algorithm>
using namespace std;
	
ifstream fin("zone.in");
ofstream fout("zone.out");

int N;
int viz[11], A[600][600];;
long long matr[600][600], C[11];
int Linie[5], Coloana[5];
	
bool gata;
	
	
long long Submatrice(int x1,int y1,int x2,int y2)
	
{
	
    return matr[x2][y2]+matr[x1][y1]-matr[x1][y2]-matr[x2][y1];
	
}
	
 
	
inline int ExistaInVector(long long c)
	
{
	
    for(int i=1;i<=9;i++)
	
        if(!viz[i] && C[i] == c)
	
            return i;
	
         
	
    return 0;
	
}
	
inline bool EsteBunaDistribuirea(int l1,int l2,int c1,int c2)
{
    int a;
	
    Linie[1] = l1; Linie[2] = l2; Linie[3] = Coloana[3] = N;
    Coloana[1] = c1; Coloana[2] = c2;
	
     
	
    for(int i=1;i<=3;i++)
    {
	
        for(int j=1;j<=3;j++)
        {
	
            a = ExistaInVector(Submatrice(Linie[i-1],Coloana[j-1],Linie[i],Coloana[j]));
	
            if(!a || viz[a]) return false; viz[a] = 1;
	
        }
    }
	
    return true;
	
}
	
 
	
void Rezolvare()
{
	
    for(int i=1;i<N && !gata;i++)
	
        for(int j=1;j<N && !gata;j++)
	
            if(ExistaInVector(matr[i][j]))
	
                for(int k=i+1;k<N && !gata;k++)
	
                    for(int l=j+1;l<N && !gata;l++)
	
                    {
	
                        gata = EsteBunaDistribuirea(i,k,j,l);
	
                        for(int i = 1; i <= 9; i++)
                        {
                        	viz[i] = 0;
                        }
	
                    }
	
}
	
 
	
int main()	
{
    fin >> N;
	for(int i = 1; i <= 9; i++)
	{
		fin >> C[i];
	}
	sort(C+1, C+10);

	for(int i = 1; i <= N; i++)
	{
		for(int j = 1; j <= N; j++)
		{
			fin >> A[i][j];
		}
	}
	
	for(int i = 1; i <= N; i++)
	{
		for(int j = 1; j <= N; j++)
		{
			matr[i][j] = A[i][j] + matr[i-1][j] + matr[i][j-1] - matr[i-1][j-1];
		}
	}
    Rezolvare();
	
     
	
    fout <<Linie[1]<<" " <<Linie[2]<<" "<<Coloana[1]<<" "<<Coloana[2];
    fin.close();
    fout.close();
	
}