#include <bits/stdc++.h>
using namespace std;
const long long NR = 5e3 + 20;
const long long oo = 1e16 + 100;
const long long MOD = 1e9 + 7;
long long n, a[2002][6002];
long long st_jos[2002][6002];
signed main() {
  long long i, j;
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (i = 1; i <= n; ++i) {
    for (j = 1 + n; j <= n * 2; ++j) {
      cin >> a[i][j];
    }
  }
  for (j = 1; j <= n * 2; ++j) {
    long long sum = 0;
    for (long long i1 = 1, j1 = j; i1 <= n; ++i1, ++j1) {
      sum += a[i1][j1];
    }
    for (long long i1 = 1, j1 = j; i1 <= n; ++i1, ++j1) {
      st_jos[i1][j1] += sum;
    }
  }
  for (j = n * 3; j >= n; --j) {
    long long sum = 0;
    for (long long i1 = 1, j1 = j; i1 <= n; ++i1, --j1) {
      sum += a[i1][j1];
    }
    for (long long i1 = 1, j1 = j; i1 <= n; ++i1, --j1) {
      st_jos[i1][j1] += sum - a[i1][j1];
    }
  }
  long long best1 = -1, best2 = -1, x_1, y_1, x_2, y_2;
  for (i = 1; i <= n; ++i) {
    for (j = n + 1; j <= n * 2; ++j) {
      if ((i + j) % 2 && st_jos[i][j] > best1) {
        best1 = st_jos[i][j];
        x_1 = i;
        y_1 = j - n;
      }
      if ((i + j) % 2 == 0 && st_jos[i][j] > best2) {
        best2 = st_jos[i][j];
        x_2 = i;
        y_2 = j - n;
      }
    }
  }
  cout << best1 + best2 << '\n';
  cout << x_1 << ' ' << y_1 << ' ' << x_2 << ' ' << y_2 << '\n';
  return 0;
}
