#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;
}
	
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 = matr[Linie[i]][Coloana[j]] + matr[Linie[i-1]][Coloana[j-1]] - matr[Linie[i-1]][Coloana[j]] - matr[Linie[i]][Coloana[j-1]];
            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];
		}
	}

	bool isOk = 0;
    for(int x1 = 1; x1 < N; x1++)
    {
        for(int y1 = 1; y1 < N; y1++)
        {
            if(FoundedArea(matr[x1][y1]))
           	{
                for(int x2 = x1 + 1; x2 < N; x2++)
                {
                    for(int y2 = y1 + 1; y2 < N; y2++)
                    {
                        isOk = isSolution(x1, x2, y1, y2);
                        if(isOk == 1)
                        {
                        	 fout << Linie[1] << " " << Linie[2] << " " << Coloana[1] << " " << Coloana[2];
                        	 return 0;
                        }
                        
                        for(int i = 1; i <= 9; i++)
                        {
                        	viz[i] = 0;
                        }
	
                    }
                }
            }
        }
	}
     
	fin.close();
	fout.close();
	return 0;
}