#include<fstream>	
#include<algorithm>
using namespace std;

ifstream fin("zone.in");
ofstream fout("zone.out");
	
int N;
long long C[11], matr[600][600];
int viz[11], A[600][600], Linie[5], Coloana[5];
int L1,L2,C1,C2;
bool gata;

int FoundedArea(long long value)	
{
    for(int i = 1; i <= 9; i++)
    {
    	if(!viz[i])
    	{
    		if(C[i] == value)
    		{
    			return i;
    		}
    	}
    }
    return 0;
}

long long SumaSubmatrice(int x1,int y1,int x2,int y2)
	
{
	
    return matr[x2][y2]+matr[x1][y1]-matr[x1][y2]-matr[x2][y1];
	
}

bool isSolution(int l1,int l2,int c1,int c2)	
{
    Linie[1] = l1;
    Linie[2] = l2; 
    Linie[3] = N;
    Coloana[1] = c1;
    Coloana[2] = c2;
    Coloana[3] = N;
	
    for(int i = 1; i <= 3; i++)
    {
        for(int j = 1; j <= 3; j++)
        {
        	int calculateSubmatr = SumaSubmatrice(Linie[i-1],Coloana[j-1],Linie[i],Coloana[j]);
            int isFound = FoundedArea(calculateSubmatr);
            if(!isFound || viz[isFound])
            {
            	return false;
            } 
            viz[isFound] = 1;
        }
    }
    return true;	
}


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];
		}
	}

	int gata = 0;
    for(int i = 1; i < N && !gata;i++)
    {
	
        for(int j = 1; j < N && !gata;j++)
        {
	
            if(FoundedArea(matr[i][j]))
            {
	
                for(int k=i+1; k<N && !gata; k++)
                {
	
                    for(int l=j+1; l<N && !gata; l++)
                    {
	
                        gata = isSolution(i,k,j,l);
	
                        for(int i = 1; i <= 9; i++)
                        {
                        	viz[i] = 0;
                        }
	
                    }
                }
            }
        }
    }
    fout << Linie[1] << " " << Linie[2] << " " << Coloana[1] << " " << Coloana[2];

    fin.close();
    fout.close();
}