#include <bits/stdc++.h>
using namespace std;
int n, p = 1, q = 1, r = 1, s = 2;
long long mx1 = 0, mx2 = 0;
long long arr[2010][2010];
unordered_map<long long, long long> mp;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int t;
      cin >> t;
      arr[i][j] = t;
      mp[i + j + 5000] += t;
      mp[i - j] += t;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if ((i + j) % 2 == 0) {
        if (mx1 < mp[i + j + 5000] + mp[i - j] - arr[i][j]) {
          mx1 = mp[i + j + 5000] + mp[i - j] - arr[i][j];
          p = i + 1;
          q = j + 1;
        }
      } else {
        if (mx2 < mp[i + j + 5000] + mp[i - j] - arr[i][j]) {
          mx2 = mp[i + j + 5000] + mp[i - j] - arr[i][j];
          r = i + 1;
          s = j + 1;
        }
      }
    }
  }
  cout << mx1 + mx2 << endl
       << p << " " << q << " " << r << " " << s << " " << endl;
  return 0;
}

### Prompt

Please provide a CPP coded solution to the problem described below:

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;
int n, p = 1, q = 1, r = 1, s = 2;
long long mx1 = 0, mx2 = 0;
long long arr[2010][2010];
unordered_map<long long, long long> mp;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      int t;
      cin >> t;
      arr[i][j] = t;
      mp[i + j + 5000] += t;
      mp[i - j] += t;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if ((i + j) % 2 == 0) {
        if (mx1 < mp[i + j + 5000] + mp[i - j] - arr[i][j]) {
          mx1 = mp[i + j + 5000] + mp[i - j] - arr[i][j];
          p = i + 1;
          q = j + 1;
        }
      } else {
        if (mx2 < mp[i + j + 5000] + mp[i - j] - arr[i][j]) {
          mx2 = mp[i + j + 5000] + mp[i - j] - arr[i][j];
          r = i + 1;
          s = j + 1;
        }
      }
    }
  }
  cout << mx1 + mx2 << endl
       << p << " " << q << " " << r << " " << s << " " << endl;
  return 0;
}

```