#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 123;
const int inf = 1e9;
const int mod = 1e9 + 7;
const int bl = 300;
int n;
long long a[N][N];
long long b[N], c[N], mx[2], x[2], y[2];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  mx[0] = mx[1] = -1;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      cin >> a[i][j];
      b[i + j] += a[i][j];
      c[i - j + n] += a[i][j];
    }
  }
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      if (mx[(i + j) % 2] < b[i + j] + c[i - j + n] - a[i][j]) {
        x[(i + j) % 2] = i;
        y[(i + j) % 2] = j;
        mx[(i + j) % 2] = b[i + j] + c[i - j + n] - a[i][j];
      }
    }
  }
  cout << mx[0] + mx[1] << endl;
  cout << x[0] << ' ' << y[0] << ' ' << x[1] << ' ' << y[1];
  return 0;
}
