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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt();
            int[][] table = new int[n][];
            for (int i = 0; i < n; i++) {
                table[i] = in.readIntArray(n);
            }

            long[] lbSum = new long[n];
            for (int row = 0; row < n; row++) {
                int row1 = row;
                for (int col = 0; col < n && row1 < n; col++, row1++) {
                    lbSum[row] += table[row1][col];
                }
            }

            long[] ubSum = new long[n];
            for (int col = 0; col < n; col++) {
                int col1 = col;
                for (int row = 0; row < n && col1 < n; row++, col1++) {
                    ubSum[col] += table[row][col1];
                }
            }

            long[] luSum = new long[n];
            for (int row = 0; row < n; row++) {
                int row1 = row;
                for (int col = 0; col < n && row1 >= 0; col++, row1--) {
                    luSum[row] += table[row1][col];
                }
            }

            long[] brSum = new long[n];
            for (int col = 0; col < n; col++) {
                int col1 = col;
                for (int row = n - 1; row >= 0 && col1 < n; row--, col1++) {
                    brSum[col] += table[row][col1];
                }
            }


            long max0 = 0;
            long r0 = 0, c0 = 0;
            long max1 = 0;
            long r1 = 0, c1 = 1;
            for (int row = 0; row < n; row++) {
                for (int col = 0; col < n; col++) {
                    long val = -table[row][col];
                    if (row >= col) {
                        long t = lbSum[row - col];
                        val += t;
                    } else {
                        long t = ubSum[col - row];
                        val += t;
                    }

                    if ((row + col) < n) {
                        long t = luSum[row + col];
                        val += t;
                    } else {
                        long t = brSum[(row + col) - n + 1];
                        val += t;
                    }

                    if (((row + col) & 1) == 0) {
                        if (val > max0) {
                            max0 = val;
                            r0 = row;
                            c0 = col;
                        }
                    } else {
                        if (val > max1) {
                            max1 = val;
                            r1 = row;
                            c1 = col;
                        }
                    }
                }
            }

            out.println(max0 + max1);
            r0++;
            c0++;
            r1++;
            c1++;
            out.println(r0 + " " + c0 + " " + r1 + " " + c1);
        }

    }

    static class InputReader {
        StringTokenizer st;
        BufferedReader br;

        public InputReader(InputStream is) {
            BufferedReader br = new BufferedReader(new InputStreamReader(is));
            this.br = br;
        }

        public String n() {
            if (st == null || !st.hasMoreTokens()) {
                String nextLine = null;
                try {
                    nextLine = br.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
                if (nextLine == null)
                    return null;
                st = new StringTokenizer(nextLine);
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(n());
        }

        public int[] readIntArray(int n) {
            int[] ar = new int[n];
            for (int i = 0; i < n; i++) {
                ar[i] = nextInt();
            }
            return ar;
        }

    }
}

