{{nFjQOIRbtElH0tUd}}


#include <iostream>
#include <algorithm>
#include <vector>
#include <string>

using namespace std;

int BOARD[201][201];

int Func(int a, int b, int n){ // (a,b)에서 시작하는 최댓값 => a행 b열
    int *A = new int[n-b]; 
    for(int i=0; i<n-b; i++){
        A[i] = 0;
    }

    int MAX = 0;
    int SUM = 0;
    for(int i=a; i<n; i++){
        for(int j=b; j<n; j++){
            MAX = max(SUM + BOARD[i][j]+A[j-b], MAX);
            SUM = SUM + BOARD[i][j];
            A[j-b] = SUM + A[j-b];
        }

        SUM = 0;
    }

    delete []A;

    return MAX;
}

int main(){
    int num;
    cin >> num;

    int * A = new int[num];

    for(int i=0; i<num; i++){
        int N;
        cin >> N;

        for(int j=0; j<201; j++){
            for(int k=0; k<201; k++){
                BOARD[j][k] = 0;
            }
        }

        for(int j=0; j<N; j++){
            for(int k=0; k<N; k++){
                cin >> BOARD[j][k];
            }
        }

        int MAX = 0;
        for(int j=0; j<N; j++){
            for(int k=0; k<N; k++){
                int P = Func(j, k, N); 
                MAX = max(MAX, P);
            }
        }

        A[i] = MAX;
    }

    for(int i=0; i<num; i++){
        cout << A[i] << endl;
    }

    return 0;
}


{{B4xooi9JOizVozj6}}