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

public class C463 {

    public static void main(String[] args) {

        FastReader fastReader = new FastReader();

        Impl impl = new Impl();

        int n = fastReader.nextInt();
        int[][] nums = new int[n][n];

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

        impl.execute(nums);

    }

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    static class Impl {

        public void execute(int[][] nums) {

            int n = nums.length;
            int diags = 2 * ( n-1 ) + 1;

            long[] left = new long[diags];
            long[] right = new long[diags];

            //int[][] dia = new int[diags][diags];
            long[][] majors = new long[diags][3];


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

                    int l = j - i + diags / 2;
                    int r = j + i;

                    //dia[l][r] = 1;


                    left[l] += nums[i][j];
                    right[r] += nums[i][j];
                }
            }

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

                    int major = j - i + diags / 2;
                    int minor = j + i;

                    long sum = left[major] + right[minor] - nums[i][j];
                    if (sum == 0) {
                        majors[major][1] = i;
                        majors[major][2] = j;
                    }

                    if (sum > majors[major][0]) {
                        majors[major][0] = sum;
                        majors[major][1] = i;
                        majors[major][2] = j;
                    }
                }
            }

            long maxSum = Long.MIN_VALUE;
            long x1 = -1;
            long y1 = -1;
            long x2 = -1;
            long y2 = -1;

            for (int i = 0; i < diags; i++) {
                for (int j = i + 1; j < diags; j = j + 2) {

                    if (majors[i][0] + majors[j][0] > maxSum) {
                        maxSum = majors[i][0] + majors[j][0];
                        x1 = majors[i][1];
                        y1 = majors[i][2];
                        x2 = majors[j][1];
                        y2 = majors[j][2];
                    }
                }
            }

            x1++;
            x2++;
            y1++;
            y2++;
            System.out.println(maxSum);
            System.out.println(x1 + " " + y1 + " " + x2 + " " + y2);

        }
    }

}