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.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.BufferedReader;
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);
        OutputWriter out = new OutputWriter(outputStream);
        CGargariAndBishops solver = new CGargariAndBishops();
        solver.solve(1, in, out);
        out.close();
    }

    static class CGargariAndBishops {
        static int n;
        static int[][] grid;
        static long[][][] sum;
        static int[] dr = {1, 1};
        static int[] dc = {1, -1};

        public void solve(int testNumber, InputReader in, OutputWriter out) {
            n = in.nextInt();
            grid = new int[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    grid[i][j] = in.nextInt();
                }
            }
            // 0 ->right 1->left
            sum = new long[n][n][2];
            for (long row[][] : sum)
                for (long[] r : row) Arrays.fill(r, -1);

            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    dfs(i, j, 0, 0);
                    dfs(i, j, 1, 0);
                }
            }
            long white = Integer.MIN_VALUE;
            long black = Integer.MIN_VALUE;
            int xw = 0, yw = 0, xb = 0, yb = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j += 2) {

                    if (i % 2 == 0) {
                        if (sum[i][j][0] + sum[i][j][1] - grid[i][j] > white) {
                            white = sum[i][j][0] + sum[i][j][1] - grid[i][j];
                            xw = i + 1;
                            yw = j + 1;
                        }
                        if (j + 1 < n && sum[i][j + 1][0] + sum[i][j + 1][1] - grid[i][j + 1] > black) {
                            black = sum[i][j + 1][0] + sum[i][j + 1][1] - grid[i][j + 1];
                            xb = i + 1;
                            yb = j + 2;
                        }
                    } else {
                        if (sum[i][j][0] + sum[i][j][1] - grid[i][j] > black) {
                            black = sum[i][j][0] + sum[i][j][1] - grid[i][j];
                            xb = i + 1;
                            yb = j + 1;
                        }
                        if (j + 1 < n && sum[i][j + 1][0] + sum[i][j + 1][1] - grid[i][j + 1] > white) {
                            white = sum[i][j + 1][0] + sum[i][j + 1][1] - grid[i][j + 1];
                            xw = i + 1;
                            yw = j + 2;
                        }
                    }


                }
            }
            out.println((white + black));
            out.println(xw + " " + yw + " " + xb + " " + yb);
        }

        static boolean isValid(int r, int c) {
            if (r < 0 || c < 0 || r >= n || c >= n) return false;
            return true;
        }

        static void dfs(int r, int c, int dir, long s) {
            if (!isValid(r, c)) return;
            if (sum[r][c][dir] != -1) return;
            dfs(r + dr[dir], c + dc[dir], dir, s + grid[r][c]);
            if (!isValid(r + dr[dir], c + dc[dir])) {
                sum[r][c][dir] = s + grid[r][c];
                return;
            }

            sum[r][c][dir] = sum[r + dr[dir]][c + dc[dir]][dir];
        }

    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void print(Object... objects) {
            for (int i = 0; i < objects.length; i++) {
                if (i != 0) {
                    writer.print(' ');
                }
                writer.print(objects[i]);
            }
        }

        public void println(Object... objects) {
            print(objects);
            writer.println();
        }

        public void close() {
            writer.close();
        }

        public void println(long i) {
            writer.println(i);
        }

    }
}

