Gargari is jealous that his friend Caisa won the game from the previous problem. He wants to prove that he is a genius.

He has a n × n chessboard. Each cell of the chessboard has a number written on it. Gargari wants to place two bishops on the chessboard in such a way that there is no cell that is attacked by both of them. Consider a cell with number x written on it, if this cell is attacked by one of the bishops Gargari will get x dollars for it. Tell Gargari, how to place bishops on the chessboard to get maximum amount of money.

We assume a cell is attacked by a bishop, if the cell is located on the same diagonal with the bishop (the cell, where the bishop is, also considered attacked by it).

Input

The first line contains a single integer n (2 ≤ n ≤ 2000). Each of the next n lines contains n integers aij (0 ≤ aij ≤ 109) — description of the chessboard.

Output

On the first line print the maximal number of dollars Gargari will get. On the next line print four integers: x1, y1, x2, y2 (1 ≤ x1, y1, x2, y2 ≤ n), where xi is the number of the row where the i-th bishop should be placed, yi is the number of the column where the i-th bishop should be placed. Consider rows are numbered from 1 to n from top to bottom, and columns are numbered from 1 to n from left to right.

If there are several optimal solutions, you can print any of them.

Examples

Input

4
1 1 1 1
2 1 1 0
1 1 1 0
1 0 0 1


Output

12
2 2 3 2

import java.util.Arrays;
import java.util.Scanner;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;

public class Main {

    static int n;
    static int[][] board;
    static long[][] scores;

    public static void calcPosDiag() {

        int temp = 0;
        long sum;
        int cx;
        int cy;

        for (int i = 0; i < n; i++) {
            sum = 0;
            for (cx = i, cy = 0; cx >= 0; cx--, cy++) {
                sum += board[cx][cy];
            }
            for (cx = i, cy = 0; cx >= 0; cx--, cy++) {
                scores[cx][cy] += sum;
            }
        }

        for (int i = n - 1; i >= 1; i--) {  // i >= 1 to not recalculate the mid section
            sum = 0;
            for (cx = i, cy = n - 1; cx < n; cx++, cy--) {
                sum += board[cx][cy];
            }
            for (cx = i, cy = n - 1; cx < n; cx++, cy--) {
                scores[cx][cy] += sum;
            }
        }
    }

    public static void calcNegDiag() {

        int temp = 0;
        long sum;
        int cx;
        int cy;

        for (int i = 0; i < n; i++) {
            sum = 0;

            for (cx = 0, cy = i; cy < n; cx++, cy++) {
                sum += board[cx][cy];
            }
            for (cx = 0, cy = i; cy < n; cx++, cy++) {
                scores[cx][cy] += sum - board[cx][cy];  // To make up for adding the value twice during the pos and neg
            }

        }


        for (int i = 1; i < n; i++) {  // i = 1 to not recalculate the mid
            sum = 0;

            for (cx = i, cy = 0; cx < n; cx++, cy++) {
                sum += board[cx][cy];
            }

            for (cx = i, cy = 0; cx < n; cx++, cy++) {
                scores[cx][cy] += sum - board[cx][cy];  // To make up for adding the value twice during the pos and neg
            }
        }

    }


    public static void main(String[] args) throws IOException{
        Reader sc = new Reader();

        n = sc.nextInt();

        board = new int[n][n];
        scores = new long[n][n];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                board[i][j] = sc.nextInt();
            }
        }

        calcPosDiag();
        calcNegDiag();


        long evenMax = -1;
        int[] ec = {-1, -1};
        long oddMax = -1;
        int[] oc = {-1, -1};

        // Evens
        for (int i = 0; i < n; i++) {
            for (int j = (i % 2 == 0) ? 0 : 1; j < n; j += 2) {
                if (scores[i][j] > evenMax) {
                    evenMax = scores[i][j];
                    ec[0] = i + 1;
                    ec[1] = j + 1;
                }
            }
        }

        // odds
        for (int i = 0; i < n; i++) {
            for (int j = (i % 2 == 1) ? 0 : 1; j < n; j += 2) {
                if (scores[i][j] > oddMax) {
                    oddMax = scores[i][j];
                    oc[0] = i + 1;
                    oc[1] = j + 1;
                }
            }
        }

        System.out.println(evenMax + oddMax);
        System.out.println(ec[0] + " " + ec[1] + " " + oc[0] + " " + oc[1]);
    }

    static class Reader
    {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader()
        {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException
        {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException
        {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1)
            {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException
        {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do
            {
                ret = ret * 10 + c - '0';
            }  while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException
        {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException
        {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            }
            while ((c = read()) >= '0' && c <= '9');

            if (c == '.')
            {
                while ((c = read()) >= '0' && c <= '9')
                {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException
        {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException
        {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException
        {
            if (din == null)
                return;
            din.close();
        }
    }
}
