#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream in("zone.in");
ofstream out("zone.out");

int m[513][513], mpsum[513][513];
int sums[9];
bool sel_sums[9];
int n;

struct quadruple {
    int x, y, z, w;
    quadruple(int a, int b, int c, int d): x(a), y(b), z(c), w(d) {};
    bool operator<(quadruple &B) {
        if (x < B.x)
            return true;
        if (x > B.x)
            return false;
        if (y < B.y)
            return true;
        if (y > B.y)
            return false;
        if (z < B.z)
            return true;
        if (z > B.z)
            return false;
        if (w <= B.w)
            return true;
        return false;
    }
};

int submat(int i1, int j1, int i2, int j2) {
    return mpsum[i2][j2] - mpsum[i2][j1 - 1] - mpsum[i1 - 1][j2] + mpsum[i1 - 1][j1 - 1];
}

int find_cr(bool col, int csum, int bound_left, int bound_right, int i1, int j1, int k2) {
    int left = bound_left, right = bound_right, middle, subsum;
    while (left <= right) {
        middle = left + (right - left) / 2;
        if (col)
            subsum = submat(i1, j1, k2, middle);
        else
            subsum = submat(i1, j1, middle, k2);
        if (subsum == csum)
            return middle;
        else if (subsum < csum)
            left = middle + 1;
        else
            right = middle - 1;
    }
    return -1;
}

int main() {
    in >> n;
    for (int i = 0; i < 9; i++) {
        in >> sums[i];
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            in >> m[i][j];
            mpsum[i][j] = m[i][j] + mpsum[i][j - 1] + mpsum[i - 1][j] - mpsum[i - 1][j - 1];
        }
    }

    quadruple sol(512, 512, 512, 512);
    int csum, l1, l2, c1, c2;
    for (int i = 0; i < 9; i++) {
        csum = sums[i];

        // cautare submatrice 1
        for (l1 = 1; l1 <= n - 2; l1++) {
            if (csum < submat(1, 1, l1, 1))
                break;
            c1 = find_cr(true, csum, 1, n - 2, 1, 1, l1);
            if (c1 == -1)
                continue;

            // am gasit o pereche valida l1 c1, continuam similar pentru gasirea lui c2
            // cout << csum << ' ' << l1 << ' ' << c1 << '\n';
            for (int j = 0; j < 9; j++) {
                if (i != j) {
                    csum = sums[j];
                    if (csum < submat(1, c1 + 1, l1, c1 + 1))
                        break;
                    c2 = find_cr(true, csum, c1 + 1, n - 1, 1, c1 + 1, l1);
                    if (c2 == -1)
                        continue;

                    // am gasit c2 valid, continuam simetric pentru a verifica validitatea unui l2
                    //cout << '\t' << csum << ' ' << l1 << ' ' << c2 << '\n';
                    for (int k = 0; k < 9; k++) {
                        if (k != i && k != j) {
                            csum = sums[k];
                            if (csum < submat(l1 + 1, 1, l1 + 1, c1))
                                break;
                            l2 = find_cr(false, csum, l1 + 1, n - 1, l1 + 1, 1, c1);
                            if (l2 == -1)
                                continue;
                            
                            //cout << "\t\t" << csum << ' ' << l1 << ' ' << c1 << ' ' << l2 << ' ' << c2 << '\n';
                            
                            // am gasit cei 4 indici cu sumele in pozitiile i, j si k
                            // verificam daca putem atribui zonelor ramase una din celelalte 6 sume
                            sel_sums[i] = sel_sums[j] = sel_sums[k] = true;
                            int sum[6], nr = 3;
                            sum[0] = submat(1, c2 + 1, l1, n);
                            sum[1] = submat(l1 + 1, c1 + 1, l2, c2);
                            sum[2] = submat(l1 + 1, c2 + 1, l2, n);
                            sum[3] = submat(l2 + 1, 1, n, c1);
                            sum[4] = submat(l2 + 1, c1 + 1, n, c2);
                            sum[5] = submat(l2 + 1, c2 + 1, n, n);
                            for (int p = 0; p < 6; p++) {
                                for (int q = 0; q < 9; q++) {
                                    if (sum[p] == sums[q] && sel_sums[q] == false) {
                                        sel_sums[q] = true;
                                        nr++;
                                    }
                                }
                            }
                            quadruple curr = {l1, c1, l2, c2};
                            if (nr == 9 && curr < sol)
                               sol = curr;
                        }
                    }
                }
            }
        }
    }
    out << sol.x << ' ' << sol.z << ' ' << sol.y << ' ' << sol.w << '\n';
    return 0;
}