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.IOException;
import java.util.InputMismatchException;
import java.io.PrintStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author karan173
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }
}

class TaskC
{
    long blackMax = 0;
    long whiteMax = 0;
    int n;
    long h[][];
    long sums[][];
    public void solve(int testNumber, FastReader in, PrintWriter out)
    {
        n = in.ni ();
        h = new long[n][n];
        sums = new long[n][n];
        long dp[][] = new long[n][n];
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < n; j++)
            {
                h[i][j] = in.ni ();
                for (int k = 0; k < 4; k++)
                {
                    dp[i][j] = 0;
                }sums[i][j] += dp[i][j];

            }
        }

        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < n; j++)
            {
                dp[i][j] = h[i][j];
                if (validate (i - 1, j - 1))
                {
                    dp[i][j] += dp[i - 1][j - 1];
                }
                sums[i][j] += dp[i][j];
            }
        }

        for (int i = 0; i < n; i++)
        {
            for (int j = n - 1; j >= 0; j--)
            {
                dp[i][j] = h[i][j];
                if (validate (i - 1, j + 1))
                {
                    dp[i][j] += dp[i - 1][j + 1];
                }
                sums[i][j] += dp[i][j];
            }
        }

        for (int i = n - 1; i >= 0; i--)
        {
            for (int j = 0; j < n; j++)
            {
                dp[i][j] = h[i][j];
                if (validate (i + 1, j - 1))
                {
                    dp[i][j] += dp[i + 1][j - 1];
                }
                sums[i][j] += dp[i][j];
            }
        }

        for (int i = n - 1; i >= 0; i--)
        {
            for (int j = 0; j < n; j++)
            {
                dp[i][j] = h[i][j];
                if (validate (i + 1, j + 1))
                {
                    dp[i][j] += dp[i + 1][j + 1];
                }
                sums[i][j] += dp[i][j];
            }
        }

        boolean sColor = true;
        int blackI = 1;
        int blackJ = 1;
        int whiteI =  1;
        int whiteJ = 2;
        for (int i = 0; i < n; i++, sColor = !sColor)
        {
            boolean color = sColor;
            for (int j = 0; j < n; j++, color = !color)
            {
                long sum = sums[i][j] - 3 * h[i][j];
                if (color && sum > blackMax)
                {
                    blackMax = sum;
                    blackI = i+1;
                    blackJ = j + 1;
                }
                if (!color && sum > whiteMax)
                {
                    whiteMax = sum;
                    whiteI = i + 1;
                    whiteJ = j + 1;
                }
            }
        }
        out.println (blackMax + whiteMax);
        out.println (whiteI + " " + whiteJ + " " + blackI + " " + blackJ);


    }


    private boolean validate(int ii, int jj)
    {
        return ii >= 0 && jj >= 0 && ii < n && jj < n;
    }
}

class FastReader
{

    public InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;
    private SpaceCharFilter filter;

    public FastReader(InputStream stream)
    {
        this.stream = stream;
    }

    public FastReader()
    {

    }

    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 int ni()
    {
        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 boolean isSpaceChar(int c)
    {
        if (filter != null)
        {
            return filter.isSpaceChar (c);
        }
        return isWhitespace (c);
    }

    public static boolean isWhitespace(int c)
    {
        return c==' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public interface SpaceCharFilter
    {
        public boolean isSpaceChar(int ch);
    }
}
