#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int Mod = 1000000007;
const int INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
const double e = exp(1);
const double PI = acos(-1);
const double ERR = 1e-10;
const int nmax = 2005;
long long d1[2 * nmax], d2[2 * nmax], sol[2];
pair<int, int> v[2];
int arr[nmax][nmax];
inline void update(const int c, const int i, const int j, const long long val) {
  if (val > sol[c]) {
    sol[c] = val;
    v[c].first = i;
    v[c].second = j;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  cin >> n;
  sol[0] = sol[1] = -1;
  for (int i = 1; i < n + 1; i++)
    for (int j = 1; j < n + 1; j++) {
      int x;
      cin >> arr[i][j];
      d1[i + j] += arr[i][j];
      d2[i - j + n] += arr[i][j];
    }
  for (int i = 1; i < n + 1; i++)
    for (int j = 1; j < n + 1; j++) {
      update((i + j) & 1, i, j, d1[i + j] + d2[i - j + n] - arr[i][j]);
    }
  if (v[0] > v[1]) swap(v[0], v[1]);
  cout << sol[0] + sol[1] << "\n";
  cout << v[0].first << " " << v[0].second << " " << v[1].first << " "
       << v[1].second << "\n";
  return 0;
}
