#include <bits/stdc++.h>
using namespace std;
int n;
long long mat[2020][2020], pos[4040], neg[4040];
int main() {
  scanf("%d", &n);
  memset(pos, 0, sizeof(pos));
  memset(neg, 0, sizeof(neg));
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      scanf("%I64d", &mat[i][j]);
      pos[i + j - 2] += mat[i][j];
      neg[i - j + n - 1] += mat[i][j];
    }
  }
  pair<int, int> best[2];
  long long val[2] = {-1LL, -1LL};
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      long long sum = pos[i + j - 2] + neg[i - j + n - 1] - mat[i][j];
      ;
      if (val[0] < sum) {
        val[0] = sum;
        best[0] = pair<int, int>(i, j);
      }
      if (j < n) {
        ++j;
        sum = pos[i + j - 2] + neg[i - j + n - 1] - mat[i][j];
        if (val[1] < sum) {
          val[1] = sum;
          best[1] = pair<int, int>(i, j);
        }
      }
    }
    swap(best[0], best[1]);
    swap(val[0], val[1]);
  }
  printf("%I64d\n", val[0] + val[1]);
  printf("%d %d %d %d\n", best[0].first, best[0].second, best[1].first,
         best[1].second);
  return 0;
}
