#include<bits/stdc++.h>

 using namespace std;

 #define pb(x) push_back(x)

 #define ll long long

 #define mk(x, y) make_pair(x, y)

 #define lson l, m, rt<<1

 #define mem(a) memset(a, 0, sizeof(a))

 #define rson m+1, r, rt<<1|1

 #define mem1(a) memset(a, -1, sizeof(a))

 #define mem2(a) memset(a, 0x3f, sizeof(a))

 #define rep(i, a, n) for(int i = a; i<n; i++)

 #define ull unsigned long long

 typedef pair<int, int> pll;

 const double PI = acos(-1.0);

 const double eps = 1e-;

 const int mod = 1e9+;

 const int inf = ;

 const int dir[][] = { {-, }, {, }, {, -}, {, } };

 ll a[][], d1[], d2[];

 int ans[][];

 int main()

 {

     int n;

     cin>>n;

     for(int i = ; i<n; i++) {

         for(int j = ; j<n; j++) {

             scanf("%d", &a[i][j]);

             d1[i+j] += a[i][j];

             d2[i-j+n] += a[i][j];

         }

     }

     for(int i = ; i<n; i++) {

         for(int j = ; j<n; j++) {

             a[i][j] = d1[i+j]+d2[i-j+n]-a[i][j];

         }

     }

     ans[][] = ans[][] = ans[][] = ;

     ans[][] = ;

     for(int i = ; i<n; i++) {

         for(int j = ; j<n; j++) {

             if((i+j)&) {

                 if(a[i][j]>a[ans[][]][ans[][]]) {

                     ans[][] = i;

                     ans[][] = j;

                 }

             } else {

                 if(a[i][j]>a[ans[][]][ans[][]]) {

                     ans[][] = i;

                     ans[][] = j;

                 }

             }

         }

     }

     cout<<a[ans[][]][ans[][]]+a[ans[][]][ans[][]]<<endl;

     cout<<ans[][]+<<" "<<ans[][]+<<" "<<ans[][]+<<" "<<ans[][]+<<endl;

 }