#include <bits/stdc++.h>
long long a[2005][2005];
long long b[2005][2005];
long long c[2005][2005];
long long d[2005][2005];
int main() {
  int n, x, y, x1 = 1, y1 = 1, x2 = 1, y2 = 2;
  long long sum;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= n; j++) scanf("%I64d", &a[i][j]);
  for (int j = 1; j <= n; j++) {
    x = 1;
    y = j;
    sum = 0;
    while (x <= n && y <= n) {
      sum += a[x][y];
      x++;
      y++;
    }
    x = 1;
    y = j;
    while (x <= n && y <= n) {
      b[x][y] = sum;
      x++;
      y++;
    }
  }
  for (int i = 1; i <= n; i++) {
    x = i;
    y = 1;
    sum = 0;
    while (x <= n && y <= n) {
      sum += a[x][y];
      x++;
      y++;
    }
    x = i;
    y = 1;
    while (x <= n && y <= n) {
      b[x][y] = sum;
      x++;
      y++;
    }
  }
  for (int j = 1; j <= n; j++) {
    x = 1;
    y = j;
    sum = 0;
    while (x <= n && y > 0) {
      sum += a[x][y];
      x++;
      y--;
    }
    x = 1;
    y = j;
    while (x <= n && y > 0) {
      c[x][y] = sum;
      x++;
      y--;
    }
  }
  for (int i = 1; i <= n; i++) {
    x = i;
    y = n;
    sum = 0;
    while (x <= n && y > 0) {
      sum += a[x][y];
      x++;
      y--;
    }
    x = i;
    y = n;
    while (x <= n && y > 0) {
      c[x][y] = sum;
      x++;
      y--;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      d[i][j] = b[i][j] + c[i][j] - a[i][j];
      if ((i + j) % 2 == 0 && d[i][j] > d[x1][y1]) {
        x1 = i;
        y1 = j;
      }
      if ((i + j) % 2 == 1 && d[i][j] > d[x2][y2]) {
        x2 = i;
        y2 = j;
      }
    }
  }
  printf("%I64d\n", d[x1][y1] + d[x2][y2]);
  printf("%d %d %d %d", x1, y1, x2, y2);
  return 0;
}
