#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  map<long long, long long> d1, d2;
  vector<vector<long long>> ar(n, vector<long long>(n));
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      cin >> ar[i][j];
      d1[i - j] += ar[i][j];
      d2[i + j] += ar[i][j];
    }
  }
  vector<long long> s0(3, -1), s1(3, -1);
  vector<long long> ans(5, -1);
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < n; j++) {
      if ((i + j) % 2 == 0) {
        long long temp = d1[i - j] + d2[i + j] - ar[i][j];
        if (temp > s0[0]) s0 = {temp, i, j};
        if (s1[0] != -1) {
          auto it = s1;
          temp += it[0];
          if (temp > ans[0]) ans = {temp, i + 1, j + 1, it[1] + 1, it[2] + 1};
        }
      } else {
        long long temp = d1[i - j] + d2[i + j] - ar[i][j];
        if (temp > s1[0]) s1 = {temp, i, j};
        if (s0[0] != -1) {
          auto it = s0;
          temp += it[0];
          if (temp > ans[0]) ans = {temp, i + 1, j + 1, it[1] + 1, it[2] + 1};
        }
      }
    }
  cout << ans[0] << "\n";
  for (long long i = 1; i <= 4; i++) cout << ans[i] << " ";
  return 0;
}

### Prompt

Generate a Cpp solution to the following problem:

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

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  map<long long, long long> d1, d2;
  vector<vector<long long>> ar(n, vector<long long>(n));
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      cin >> ar[i][j];
      d1[i - j] += ar[i][j];
      d2[i + j] += ar[i][j];
    }
  }
  vector<long long> s0(3, -1), s1(3, -1);
  vector<long long> ans(5, -1);
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < n; j++) {
      if ((i + j) % 2 == 0) {
        long long temp = d1[i - j] + d2[i + j] - ar[i][j];
        if (temp > s0[0]) s0 = {temp, i, j};
        if (s1[0] != -1) {
          auto it = s1;
          temp += it[0];
          if (temp > ans[0]) ans = {temp, i + 1, j + 1, it[1] + 1, it[2] + 1};
        }
      } else {
        long long temp = d1[i - j] + d2[i + j] - ar[i][j];
        if (temp > s1[0]) s1 = {temp, i, j};
        if (s0[0] != -1) {
          auto it = s0;
          temp += it[0];
          if (temp > ans[0]) ans = {temp, i + 1, j + 1, it[1] + 1, it[2] + 1};
        }
      }
    }
  cout << ans[0] << "\n";
  for (long long i = 1; i <= 4; i++) cout << ans[i] << " ";
  return 0;
}

```