#include<stdio.h>
#include<algorithm>
using namespace std;

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

#define Max9 11
#define MaxN 600
#define ll long long

int N;
ll C[Max9];
int viz[Max9];
int A[MaxN][MaxN];
ll Best[MaxN][MaxN];
int Linie[5];
int Coloana[5];
bool ver;


inline ll SumaSubmatrice(int x1,int y1,int x2,int y2)
{
    return Best[x2][y2]+Best[x1][y1]-Best[x1][y2]-Best[x2][y1];
}

inline int ExistaInVector(ll c)
{
    for(int i=1;i<=9;i++)
        if(!viz[i] && C[i] == c)
            return i;

    return 0;
}

inline void Initializare(void)
{
    for(int i=1;i<=9;i++)
        viz[i] = 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(SumaSubmatrice(Linie[i-1],Coloana[j-1],Linie[i],Coloana[j]));
            if(!a || viz[a]) return false; viz[a] = 1;
        }

    return true;
}

int main()
{
		fscanf(f,"%d",&N);

		for(int i = 1;i <= 9;i ++)
				fscanf(f, "%lld ", &C[i]);
		for(int i = 1; i <= N; i++)
				for(int j = 1; j <= N; j++)
						fscanf(f, "%d ", &A[i][j]);

    for(int i=1;i<=N;i++)
        for(int j=1;j<=N;j++)
            Best[i][j] = 1LL*A[i][j] + Best[i-1][j]+Best[i][j-1]-Best[i-1][j-1];

    sort(C+1,C+10);

    for(int i=1;i<N && !ver;i++)
        for(int j=1;j<N && !ver;j++)
            if(ExistaInVector(Best[i][j]))
                for(int k=i+1;k<N && !ver;k++)
                    for(int l=j+1;l<N && !ver;l++)
                    {
                        ver = EsteBunaDistribuirea(i,k,j,l);
                        Initializare();
                    }

    fprintf(g,"%d %d %d %d\n",Linie[1],Linie[2],Coloana[1],Coloana[2]);
}