#include <bits/stdc++.h>
using namespace std;
long long n, grid[2500][2500], R[10005], C[10005];
vector<pair<long long, pair<long long, long long> > > A, B;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n;
  for (long long i = 0; i < n; i++)
    for (long long j = 0; j < n; j++)
      cin >> grid[i][j], R[i + j] += grid[i][j], C[i - j + 5000] += grid[i][j];
  long long Min = (long long)1e18;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      long long Z = R[i + j] + C[i - j + 5000] - grid[i][j];
      Min = min(Min, Z);
      if (B.size() < 5000 || Z >= Min)
        B.push_back(make_pair(R[i + j] + C[i - j + 5000] - grid[i][j],
                              make_pair(i, j)));
    }
  }
  sort(B.begin(), B.end());
  reverse(B.begin(), B.end());
  long long a, b, x, y;
  long long Max = 0;
  for (long long i = 0; i < min((long long)B.size(), 5000LL); i++) {
    for (long long j = 0; j < min((long long)B.size(), 3000LL); j++) {
      if (B[i].first + B[j].first >= Max &&
          ((B[i].second.first + B[i].second.second - B[j].second.first +
            B[j].second.second)) %
              2 &&
          ((B[i].second.first - B[i].second.second -
            (B[j].second.first - B[j].second.second))) %
              2) {
        a = B[i].second.first, b = B[i].second.second;
        x = B[j].second.first, y = B[j].second.second;
        Max = B[i].first + B[j].first;
      }
    }
  }
  cout << Max << endl;
  cout << a + 1 << ' ' << b + 1 << ' ' << x + 1 << ' ' << y + 1 << endl;
  return 0;
}
