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


public class CF264C {
	public static void main(String [] args) {
//		InputStreamReader in = new InputStreamReader(System.in);
//		
//		int n = in.nextInt();
//		
//		int [][] a = new int[n][n];
//		
//		for (int i = 0; i < n; i++) {
//			for (int j = 0; j < n; j++) {
//				a[i][j] = in.nextInt();
//			}
//		}
//
//		in.close();
		
		BufferedReader bi = new BufferedReader(new InputStreamReader(System.in));
		String line = null;
		try {
			line = bi.readLine();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		int n = Integer.parseInt(line);
		int [][] a = new int[n][n];
		
		//int row = 0;
		try {
			//while ((line = bi.readLine()) != null) {
			for (int row = 0; row < n; row++) {
				String [] split = null;
				
				while (true) {
					line = bi.readLine();
					split = line.split(" ");
					if (split.length == n) break;
				}
				
				for (int j = 0; j < n; j++) {
					a[row][j] = Integer.parseInt(split[j]);
				}
			}
//			}
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		long [] slash = new long[2*n - 1];
		long [] backslash = new long[2*n - 1];
		
		for (int i = 0; i < n; i++) {
			long thisSlash = 0L;
			int curI = i;
			int curJ = 0;
			while (withinBounds(curI, curJ, n)) {
				thisSlash += a[curI][curJ];
				curI--;
				curJ++;
			}
			slash[i] = thisSlash;
		}
		
		for (int j = 1; j < n; j++) {
			long thisSlash = 0L;
			int curI = n - 1;
			int curJ = j;
			while (withinBounds(curI, curJ, n)) {
				thisSlash += a[curI][curJ];
				curI--;
				curJ++;
			}
			slash[n + j - 1] = thisSlash;
		}
		
		for (int i = n-1; i >= 0; i--) {
			long thisBackslash = 0L;
			int curI = i;
			int curJ = 0;
			while (withinBounds(curI, curJ, n)) {
				thisBackslash += a[curI][curJ];
				curI++;
				curJ++;
			}
			backslash[n-1-i] = thisBackslash;
		}
		
		for (int j = 1; j < n; j++) {
			long thisBackslash = 0L;
			int curI = 0;
			int curJ = j;
			while (withinBounds(curI, curJ, n)) {
				thisBackslash += a[curI][curJ];
				curI++;
				curJ++;
			}
			backslash[n + j - 1] = thisBackslash;
		}
		
		long blackMax = Long.MIN_VALUE;
		int bI =0 , bJ = 0;
		long whiteMax = Long.MIN_VALUE;
		int wI = 0, wJ = 0;
		
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				int slashIdx = i + j;
				int backslashIdx = (n - 1 - i) + j;
				long attackSum = slash[slashIdx] + backslash[backslashIdx] - a[i][j];
				
				if ((i + j) % 2 == 0) {
					if (blackMax < attackSum) {
						blackMax = attackSum;
						bI = i;
						bJ = j;
					}					
				} else {
					if (whiteMax < attackSum) {
						whiteMax = attackSum;
						wI = i;
						wJ = j;
					}
				}
			}
		}
		
		PrintWriter out = new PrintWriter(System.out);
		
		out.println(blackMax + whiteMax);
		out.print((bI+1) + " " + (bJ+1) + " " + (wI+1) + " " + (wJ+1));
		
		out.close();
	}
	
	public static boolean withinBounds(int i, int j, int n) {
		return (i >= 0 && i < n && j >= 0 && j < n);
	}
}

