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

public class Main implements Runnable 
{
    static class InputReader 
    {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private SpaceCharFilter filter;
        private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        public InputReader(InputStream stream) 
        {
            this.stream = stream;
        }
        
        public int read()
        {
            if (numChars==-1) 
                throw new InputMismatchException();
            
            if (curChar >= numChars) 
            {
                curChar = 0;
                try
                {
                    numChars = stream.read(buf);
                }
                catch (IOException e)
                {
                    throw new InputMismatchException();
                }
                
                if(numChars <= 0)               
                    return -1;
            }
            return buf[curChar++];
        }
    
        public String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }    
            return str;
        }
        public int nextInt() 
        {
            int c = read();
            
            while(isSpaceChar(c)) 
                c = read();
        
            int sgn = 1;
        
            if (c == '-') 
            {
                sgn = -1;
                c = read();
            }
            
            int res = 0;
            do
            {
                if(c<'0'||c>'9') 
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c)); 
        
            return res * sgn;
        }
        
        public long nextLong() 
        {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-')
            {
                sgn = -1;
                c = read();
            }
            long res = 0;
            
            do 
            {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }    
            while (!isSpaceChar(c));
                return res * sgn;
        }
        
        public double nextDouble() 
        {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            int sgn = 1;
            if (c == '-')
            {
                sgn = -1;
                c = read();
            }
            double res = 0;
            while (!isSpaceChar(c) && c != '.') 
            {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res *= 10;
                res += c - '0';
                c = read();
            }
            if (c == '.') 
            {
                c = read();
                double m = 1;
                while (!isSpaceChar(c))
                {
                    if (c == 'e' || c == 'E')
                        return res * Math.pow(10, nextInt());
                    if (c < '0' || c > '9')
                        throw new InputMismatchException();
                    m /= 10;
                    res += (c - '0') * m;
                    c = read();
                }
            }
            return res * sgn;
        }
    
        public String readString() 
        {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuilder res = new StringBuilder();
            do 
            {
                res.appendCodePoint(c);
                c = read();
            } 
            while (!isSpaceChar(c));
            
            return res.toString();
        }
    
        public boolean isSpaceChar(int c) 
        {
            if (filter != null)
                return filter.isSpaceChar(c);
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }
    
        public String next()
        {
            return readString();
        }
        
        public interface SpaceCharFilter
        {
            public boolean isSpaceChar(int ch);
        }
    }
    public static void main(String args[]) throws Exception 
    {
        new Thread(null, new Main(),"Main",1<<27).start();
    }
    
    static class Pair{
        int f;
        int s;
        PrintWriter w;

        //int t;
        
        
        // Pair(int f,int s,int t){
        Pair(int f,int s, PrintWriter w){
            this.f = f;
            this.s = s;
            this.w = w;
            //this.t = t;
            
        }
        
        public static Comparator<Pair> wc = new Comparator<Pair>(){
            public int compare(Pair e1,Pair e2){
            
                //1 for swap 
                if(Math.abs(e1.f)-Math.abs(e2.f)!=0){
                    //e1.w.println("**"+e1.f+" "+e2.f);
                    return (Math.abs(e1.f)-Math.abs(e2.f));
                }
                else{
                    //e1.w.println("##"+e1.f+" "+e2.f);
                    return (Math.abs(e1.s)-Math.abs(e2.s));
                }

                
            }
        };	
    }

    public static long gcd(long a,long b){
        if(b==0)return a;
        else return gcd(b,a%b);
    }


    ////recursive BFS
    public static int bfsr(int s,ArrayList<Integer>[] a,boolean[] b,int[] pre){
        b[s]=true;
        int p = 1;
        int n = pre.length -1;
        int t = a[s].size();
        int max = 1;
        for(int i=0;i<t;i++){
            int x = a[s].get(i);
            if(!b[x]){
                //dist[x] = dist[s] + 1;
                int xz =  (bfsr(x,a,b,pre));
                p+=xz;
                max = Math.max(xz,max);
            }
        }
        //max = Math.max(max,(n-p));
        pre[s] = max;
        return p;
    }   

//// iterative BFS
    public static int bfs(int s,ArrayList<Integer>[] a,int dist,boolean[] b,PrintWriter w){
        b[s]=true;
        int siz = 0;
        dist--;
        Queue<Integer> q = new LinkedList<>();
        q.add(s);
        while(q.size()!=0 && dist>0 ){
            int i=q.poll();
            Iterator<Integer> it = a[i].listIterator();
            int z=0;
            while(it.hasNext() && dist>0){
                z=it.next();
                if(!b[z]){
                    b[z]=true;
                    dist--;
                    //dist[z] = dist[i] + 1;
                    siz++;
                    q.add(z);
                }
            }   
        
        }
        return siz;
    }

    public static int lower(int key, Integer[] a){
        int l = 0;
        int r = a.length-1;
        int res = 0;

        while(l<=r){
            int mid = (l+r)/2;

            if(a[mid]<=key){
                l = mid+1;
                res = mid+1;
            }
            else{
                r = mid -1;
            }
        }

        return res;
    }

    

    

//////////////////////////////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////////////////////////////


    public void run()
    {
        // code here
        InputReader sc = new InputReader(System.in);
        PrintWriter w = new PrintWriter(System.out);
        int defaultValue = 0;
        long mod = Long.valueOf("1000000007");

        
        // int tc = sc.nextInt();
        // while(tc-->0){

            int n = sc.nextInt();
            long ans = 0;
            long[] f = new long[(2*n)];
            long[] s = new long[(2*n)];
            long[][] a = new long[n+1][n+1];
            for(int i=1;i<=n;i++){
                for(int j=1;j<=n;j++){
                    long x = sc.nextLong();
                    a[i][j] = x;
                    f[i+j-1]+=x;
                    s[i+n-j]+=x;
                }
            }
            int x1 = -1;
            int y1 = -1;
            int x2 = -1;
            int y2 = -1;
            long b1 = -1;
            long b2 = -1;

            for(int i=1;i<=n;i++){
                for(int j=1;j<=n;j++){
                    long y = f[i+j-1]+s[i+n-j]-a[i][j];
                    if(y>b1 && (i+j)%2==1){
                        x1 = i;
                        y1 = j;
                        b1 = y;
                    }
                    else if(y>b2 && (i+j)%2==0){
                        x2 = i;
                        y2 = j;
                        b2 = y;
                    }
                }
            }
            ans = b1+b2;
            w.println(ans);
            w.println(x1+" "+y1+" "+x2+" "+y2);
            

            
            
            
            





            


            
            

            
       // }
        w.flush();
        w.close();
        
    }
    

    
}

