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
/*
 *created by Kraken on 21-04-2020 at 03:33
 */
//package com.kraken.cf.practice;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class C463 {

  public static void main(String[] args) {
    FastReader sc = new FastReader();
    int n = sc.nextInt();
    long[][] a = new long[n][n];
    for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) a[i][j] = sc.nextLong();
    long[][] ltor = new long[n][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        if (i == 0 || j == 0) ltor[i][j] += a[i][j];
        else ltor[i][j] = ltor[i - 1][j - 1] + a[i][j];
      }
    }
    for (int i = n - 2; i >= 0; i--) for (int j = n - 2; j >= 0; j--) {
      ltor[i][j] = ltor[i + 1][j + 1];
    }
    long[][] rtol = new long[n][n];
    for (int i = 0; i < n; i++) {
      for (int j = n - 1; j >= 0; j--) {
        if (i == 0 || j == n - 1) rtol[i][j] += a[i][j];
        else rtol[i][j] = rtol[i - 1][j + 1] + a[i][j];
      }
    }
    for (int i = n - 2; i >= 0; i--) for (int j = 1; j < n; j++) {
      rtol[i][j] = rtol[i + 1][j - 1];
    }
    long max1 = Long.MIN_VALUE, max2 = Long.MIN_VALUE;
    int x1 = -1, y1 = -1, x2 = -1, y2 = -1;
    for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {
      int color = (i + j) % 2;
      long ans = ltor[i][j] + rtol[i][j] - a[i][j];
      switch (color) {
        case 0:
          if (ans > max1) {
            max1 = ans;
            x1 = i + 1;
            y1 = j + 1;
          }
          break;
        case 1:
          if (ans > max2) {
            max2 = ans;
            x2 = i + 1;
            y2 = j + 1;
          }
      }
    }
//    for (long[] i : ltor)
//      System.out.println(Arrays.toString(i));
//    System.out.println();
//    for (long[] i : rtol)
//      System.out.println(Arrays.toString(i));

    System.out.println(max1 + max2);
    System.out.printf("%d %d %d %d\n", x1, y1, x2, y2);
  }

  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;
    }
  }
}
