func_code_string: #include <bits/stdc++.h>   using namespace std;   template <class T>   ostream& operator<<(ostream& os, vector<T> V) {     os <<  [  ;     for (auto v : V) os << v <<    ;     os <<  ] ;     return os;   }   template <class T>   ostream& operator<<(ostream& os, set<T> second) {     os <<  {  ;     for (auto s : second) os << s <<    ;     return os <<  } ;   }   template <class T>   ostream& operator<<(ostream& os, multiset<T> second) {     os <<  {  ;     for (auto s : second) os << s <<    ;     return os <<  } ;   }   template <class L, class R>   ostream& operator<<(ostream& os, pair<L, R> P) {     return os <<  (  << P.first <<  ,  << P.second <<  ) ;   }   template <class L, class R>   ostream& operator<<(ostream& os, map<L, R> M) {     os <<  {  ;     for (auto m : M) os <<  (  << m.first <<  :  << m.second <<  )  ;     return os <<  } ;   }   template <class L, class R>   ostream& operator<<(ostream& os, unordered_map<L, R> M) {     os <<  {  ;     for (auto m : M) os <<  (  << m.first <<  :  << m.second <<  )  ;     return os <<  } ;   }   const long long N = 2010, M = 1e9 + 7;   long long n, a[N][N], dp1[N][N], dp2[N][N], dp3[N][N];   void solve() {     cin >> n;     for (long long i = (0); i <= n - 1; i++)       for (long long j = (0); j <= n - 1; j++) cin >> a[i][j];     for (long long i = (0); i <= n - 1; i++)       dp1[i][0] = a[i][0], dp1[0][i] = a[0][i], dp2[i][n - 1] = a[i][n - 1],       dp2[0][n - i - 1] = a[0][n - i - 1];     for (long long i = (1); i <= n - 1; i++)       for (long long j = (1); j <= n - 1; j++)         dp1[i][j] = a[i][j] + dp1[i - 1][j - 1];     for (long long i = (1); i <= n - 1; i++)       for (long long j = (0); j <= n - 2; j++)         dp2[i][j] = a[i][j] + dp2[i - 1][j + 1];     for (long long i = (0); i <= n - 1; i++)       for (long long j = (0); j <= n - 1; j++) {         long long i1 = i + min(n - i - 1, n - j - 1);         long long j1 = j + min(n - i - 1, n - j - 1);         long long i2 = i + min(n - i - 1, j);         long long j2 = j - min(n - i - 1, j);         dp3[i][j] = dp1[i1][j1] + dp2[i2][j2] - a[i][j];       }     long long ans1 = LLONG_MIN, ans2 = LLONG_MIN, posx1, posy1, posx2, posy2;     for (long long i = (0); i <= n - 1; i++)       for (long long j = (0); j <= n - 1; j++) {         if ((i + j) % 2 == 0 && dp3[i][j] > ans1) {           ans1 = max(ans1, dp3[i][j]);           posx1 = i + 1;           posy1 = j + 1;         } else if ((i + j) % 2 == 1 && dp3[i][j] > ans2) {           ans2 = max(ans2, dp3[i][j]);           posx2 = i + 1;           posy2 = j + 1;         }       }     cout << ans1 + ans2 <<   n ;     cout << posx1 <<     << posy1 <<     << posx2 <<     << posy2 <<   n ;   }   int main() {     ios::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(0);     solve();     return 0;   }   