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.*; 
import java.util.StringTokenizer; 
import java.io.PrintWriter;
public class Ideone
{ 
    static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        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; 
        } 
    }
    static class aksh 
{
 
    int x, y;
    public aksh(int a, int b) 
    {
        x = a;
        y = b;
    }
}
    public static void main (String[] args) throws java.lang.Exception
    {
        // your code goes here
        FastReader sc=new FastReader();
        int n=sc.nextInt();
        int ch[][]=new int[n][n];
        for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
                ch[i][j]=sc.nextInt();
        long pd[]=new long[2*n-1];
        long sd[]=new long[2*n-1];
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<n; j++)
            {
                pd[n-1-i+j]+=ch[i][j];
                sd[i+j]+=ch[i][j];
            }
        }
        long vals[][]=new long[n][n];
        for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
                vals[i][j]+=pd[n-1-i+j]+sd[i+j]-ch[i][j];
        int x1=0,y1=0,x2=0,y2=0;
        long val1=-1,val2=-1;
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<n; j++)
            {
                if((i+j)%2==0&&val1<vals[i][j])
                {
                    val1=vals[i][j];
                    x1=i;
                    y1=j;
                }
                if((i+j)%2!=0&&val2<vals[i][j])
                {
                    val2=vals[i][j];
                    x2=i;
                    y2=j;
                }
            }
        }
        x1++;
        x2++;
        y1++;
        y2++;
        System.out.println(val1+val2);
        System.out.println(x1+" "+y1+" "+x2+" "+y2);

        
    }
} 