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.*;
import java.io.*;

public class C {
    FastScanner in;
    PrintWriter out;
    public static int n;
    public boolean check(int x, int y) {
        return (x >= 0 && x < n && y >= 0 && y < n);
    }
    public void solve() throws IOException {
        n = in.nextInt();
        long[][] a = new long[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                a[i][j] = in.nextInt(); 
            }
        }
        long[][] b = new long[n][n];
        long[][] c = new long[n][n];
        
        for (int i = 0; i < n; i++) {
            long sum = 0;
            for (int curi = i, curj = 0;check(curi, curj);curi++, curj++) {
                sum += a[curi][curj];
            }
            for (int curi = i, curj = 0;check(curi, curj);curi++, curj++) {
                b[curi][curj] = sum;
            }
            sum = 0;
            for (int curi = 0, curj = i;check(curi, curj);curi++, curj++) {
                sum += a[curi][curj];
            }
            for (int curi = 0, curj = i;check(curi, curj);curi++, curj++) {
                b[curi][curj] = sum;
            }
        }
        
        for (int i = 0; i < n; i++) {
            long sum = 0;
            for (int curi = i, curj = n - 1;check(curi, curj);curi++, curj--) {
                sum += a[curi][curj];
            }
            for (int curi = i, curj = n - 1;check(curi, curj);curi++, curj--) {
                c[curi][curj] = sum;
            }
            sum = 0;
            for (int curi = 0, curj = i;check(curi, curj);curi++, curj--) {
                sum += a[curi][curj];
            }
            for (int curi = 0, curj = i;check(curi, curj);curi++, curj--) {
                c[curi][curj] = sum;
            }
        }
        /*for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                out.print(b[i][j]);
            }
            out.println();
        }
        out.println();
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                out.print(c[i][j]);
            }
            out.println();
        }*/
        
        int[] ansi = new int[2];
        int[] ansj = new int[2];
        ansj[1] = 1;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                int z = (i + j) % 2;
                long ans = b[ansi[z]][ansj[z]] + c[ansi[z]][ansj[z]] - a[ansi[z]][ansj[z]];
                long curans = b[i][j] + c[i][j] - a[i][j];
                if (ans < curans) {
                    ansi[z] = i;
                    ansj[z] = j;
                }
            }
        }
        out.println(b[ansi[0]][ansj[0]] + c[ansi[0]][ansj[0]] - a[ansi[0]][ansj[0]] + b[ansi[1]][ansj[1]] + c[ansi[1]][ansj[1]] - a[ansi[1]][ansj[1]]);
        out.println((ansi[0] + 1) + " " + (ansj[0] + 1) +" " + (ansi[1] + 1) + " " + (ansj[1] + 1));
    }

    public void run() {
        try {
            in = new FastScanner(System.in);
            out = new PrintWriter(System.out);

            solve();

            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(File f) {
            try {
                br = new BufferedReader(new FileReader(f));
            } catch (FileNotFoundException e) {
                e.printStackTrace();
            }
        }

        FastScanner(InputStream f) {
            try {
                br = new BufferedReader(new InputStreamReader(f));
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
        
        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

    public static void main(String[] arg) {
        new C().run();
    }
}