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

public class TaskC {
	static class Pair implements Comparable<Pair> {
		int first;

		int second;

		Pair(int f, int s)
		{
			first = f;
			second = s;
		}

		public int compareTo(Pair o)
		{
			int r = first - o.first;

			if(r == 0)
				r = second - o.second;

			return r;
		}
	}

	public static void main(String[] args)
	{
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, new InputStreamReader(inputStream), out);
		out.close();
	}

	public void solve(int test, Reader input, PrintWriter out)
	{
		MyScanner in = new MyScanner(input);

		int n = in.nextInt();

		int[][] a = new int[n][n];
		long[] d1 = new long[2*n];
		long[] d2 = new long[2*n];

		for(int i = 0; i < n; i++)
			for(int j = 0; j < n; j++) {
				a[i][j] = in.nextInt();
				d1[i+j] += a[i][j];
				d2[i-j+n] += a[i][j];
			}
		long sol0 = -1;
		long sol1 = -1;

		Pair[] v = new Pair[2];
		v[0] = new Pair(0,0);
		v[1] = new Pair(0,0);

		for(int i = 0; i < n; i++) {
			for(int j = 0; j < n; j++) {
				long val = d1[i+j] + d2[i - j + n] - a[i][j];
				if(((i+j) & 1) != 0) {
					if(val > sol1) {
						sol1 = val;
						v[1].first = i+1;
						v[1].second = j+1;
					}
				} else {
					if(val > sol0) {
						sol0 = val;
						v[0].first = i+1;
						v[0].second = j+1;
					}
				}
			}
		}
		out.println(sol0+sol1);
		if(v[0].compareTo(v[1]) > 0) {
			out.println(v[1].first + " " + v[1].second);
			out.println(v[0].first + " " + v[0].second);
		} else {
			out.println(v[0].first + " " + v[0].second);
			out.println(v[1].first + " " + v[1].second);
		}
	}

	//-----------MyScanner class for faster input----------
	public static class MyScanner {
		BufferedReader br;
		StringTokenizer st;

		public MyScanner(Reader reader) {
			br = new BufferedReader(reader);
		}

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

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

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

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

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

	}
	//--------------------------------------------------------
}
