#include <bits/stdc++.h>
using namespace std;
void boost() {
  ios_base ::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
unsigned long long a[2001][2001];
unsigned long long d[8001];
unsigned long long d1[8001];
int main() {
  boost();
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      cin >> a[i][j];
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      d[i + j] += a[i][j];
      if (i - j < 0) {
        d1[(i - j) + 2 * n] += a[i][j];
      } else {
        d1[i - j] += a[i][j];
      }
    }
  }
  pair<unsigned long long, pair<int, int>> mx = make_pair(0, make_pair(0, 0));
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if ((i + j) % 2 == 0) {
        unsigned long long k = d[i + j];
        if (i - j < 0) {
          k += d1[(i - j) + 2 * n];
        } else {
          k += d1[i - j];
        }
        k -= a[i][j];
        if (mx.first < k) {
          mx.first = k;
          mx.second.first = i;
          mx.second.second = j;
        }
      }
    }
  }
  pair<unsigned long long, pair<int, int>> mx1 = make_pair(0, make_pair(0, 0));
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if ((i + j) % 2) {
        unsigned long long k = d[i + j];
        if (i - j < 0) {
          k += d1[(i - j) + 2 * n];
        } else {
          k += d1[i - j];
        }
        k -= a[i][j];
        if (mx1.first < k) {
          mx1.first = k;
          mx1.second.first = i;
          mx1.second.second = j;
        }
      }
    }
  }
  if (mx.first + mx1.first == 0) {
    cout << 0 << endl << "1 1 1 2";
    return 0;
  }
  cout << mx.first + mx1.first << endl
       << mx.second.first << " " << mx.second.second << " " << mx1.second.first
       << " " << mx1.second.second;
}
