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

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author MatFack
 */
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();
	}
}

class TaskC {
	public void solve(int testNumber, InputReader in, PrintWriter out) {
        int n = in.nextInt();

        long a[][] = new long[n][n];

        long dl[] = new long[2*n];
        long dr[] = new long[2*n];
        Arrays.fill(dl, 0);
        Arrays.fill(dr, 0);


        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                a[i][j] = in.nextLong();
                dl[i - j + n] += a[i][j];
                dr[i + j] += a[i][j];
            }
        }

        int max_x1 = -1, max_x2 = -1, max_y1 = -1, max_y2 = -1;
        long max1 = -100, max2 = -100;
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                long price = dl[i - j + n] + dr[i + j] - a[i][j];
                if(max1 < price) {
                    max1 = price;
                    max_x1 = i;
                    max_y1 = j;
                }
            }
        }

        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                long price = dl[i - j + n] + dr[i + j] - a[i][j];
                if ((max2 < price) && ((i + j) % 2 != (max_x1 + max_y1) % 2)) {
                    max2 = price;
                    max_x2 = i;
                    max_y2 = j;
                }
            }
        }


        out.println(max1 + max2);
        out.print(++max_x1 + " " + ++max_y1 + " " + ++max_x2 + " " + ++max_y2);
	}
}

class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        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());
    }

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

}

