题意：
在一个n∗n的国际象棋的棋盘上放两个象，要求不能有位置同时被两个象攻击到，然后被一个象攻击到的位置上获得得分。（象放的位置也获得该位置得分），求得分的最大值。
题目描述
Gargari is jealous that his friend Caisa won the game from the previous problem. He wants to prove that he is a genius.
He has a n×nn×n chessboard. Each cell of the chessboard has a number written on it. Gargari wants to place two bishops on the chessboard in such a way that there is no cell that is attacked by both of them. Consider a cell with number xx written on it, if this cell is attacked by one of the bishops Gargari will get xx dollars for it. Tell Gargari, how to place bishops on the chessboard to get maximum amount of money.
We assume a cell is attacked by a bishop, if the cell is located on the same diagonal with the bishop (the cell, where the bishop is, also considered attacked by it).
输入输出格式
输入格式：
The first line contains a single integer nn (2<=n<=2000)(2<=n<=2000) . Each of the next nn lines contains nn integers a_{ij}aij (0<=a_{ij}<=10^{9})(0<=aij<=109) — description of the chessboard.
输出格式：
On the first line print the maximal number of dollars Gargari will get. On the next line print four integers: x_{1},y_{1},x_{2},y_{2}x1,y1,x2,y2 (1<=x_{1},y_{1},x_{2},y_{2}<=n)(1<=x1,y1,x2,y2<=n) , where x_{i}xi is the number of the row where the ii -th bishop should be placed, y_{i}yi is the number of the column where the ii -th bishop should be placed. Consider rows are numbered from 1 to nn from top to bottom, and columns are numbered from 1 to nn from left to right.
If there are several optimal solutions, you can print any of them.