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
#include <bits/stdc++.h>
using namespace std;
const long long N = 2005;
long long d1[2 * N];
long long d2[2 * N];
long long n;
long long a[N][N];
void solve() {
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= n; j++) {
      cin >> a[i][j];
      d1[i + j] += a[i][j];
      d2[i - j + n] += a[i][j];
    }
  }
  long long sum1 = 0, sum2 = 0;
  pair<long long, long long> p1, p2;
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= n; j++) {
      if ((i + j) % 2) {
        long long y = d1[i + j] + d2[i - j + n] - a[i][j];
        if (y >= sum1) {
          p1.first = i;
          p1.second = j;
          sum1 = y;
        }
      } else {
        long long y = d1[i + j] + d2[i - j + n] - a[i][j];
        if (y >= sum2) {
          p2.first = i;
          p2.second = j;
          sum2 = y;
        }
      }
    }
  }
  cout << (sum1 + sum2) << "\n";
  cout << p1.first << " " << p1.second << "\n";
  cout << p2.first << " " << p2.second << "\n";
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t;
  t = 1;
  while (t--) solve();
  return 0;
}
