#include <bits/stdc++.h>
using namespace std;
int n;
long long a[3000][3000] = {0};
long long b[3000][3000] = {0};
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    for (int j = 0, input; j < n; j++) {
      scanf("%d", &input);
      a[i][j] = input;
    }
  }
  for (int i = 0; i < n; i++) {
    long long oni = 0;
    for (int j = 0; j < i + 1; j++) {
      oni += a[i - j][j];
    }
    for (int j = 0; j < i + 1; j++) {
      b[i - j][j] += oni;
    }
  }
  for (int i = n - 1; i >= 1; i--) {
    long long oni = 0;
    for (int j = 0; j < n - i; j++) {
      oni += a[i + j][n - j - 1];
    }
    for (int j = 0; j < n - i; j++) {
      b[i + j][n - j - 1] += oni;
    }
  }
  for (int i = n - 1; i >= 0; i--) {
    long long oni = 0;
    for (int j = 0; j < n - i; j++) {
      oni += a[i + j][j];
    }
    for (int j = 0; j < n - i; j++) {
      b[i + j][j] += oni;
    }
  }
  for (int i = 0; i < n - 1; i++) {
    long long oni = 0;
    for (int j = 0; j <= i; j++) {
      oni += a[i - j][n - j - 1];
    }
    for (int j = 0; j <= i; j++) {
      b[i - j][n - j - 1] += oni;
    }
  }
  long long max1 = -1;
  int x1 = -1, y1 = -1;
  long long max2 = -1;
  int x2 = -1, y2 = -1;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      b[i][j] -= a[i][j];
      if ((i + j) & 1) {
        if (max1 < b[i][j]) {
          max1 = b[i][j];
          x1 = i;
          y1 = j;
        }
      } else {
        if (max2 < b[i][j]) {
          max2 = b[i][j];
          x2 = i;
          y2 = j;
        }
      }
    }
  }
  cout << max1 + max2 << endl;
  cout << x1 + 1 << " " << y1 + 1 << " " << x2 + 1 << " " << y2 + 1 << endl;
  return 0;
}
