#include <bits/stdc++.h>
#define MAXN 2001
using namespace std;

int n, a[MAXN][MAXN], ans_k = 0, ans_i = -1, ans_j = -1;
int num[2000000];

bool can(int i, int j, int k) {
    //cout << i << " " << j << endl;
    if(i+(k-1)>=n-1 || j+(k-1)>=n-1) {  return false; }
    memset(num, sizeof(num), 0);
    for(int x = 1; x <= (n*n)/2 ; x++) {
        num[x] =0;
    }

    for(int x = i; x <= (i+(k-1)); x++) {
        for(int y = j; y <= (j+(k-1)); y++) {
            num[a[x][y]]++;
           // cout << a[x][y] << " ";
        }
       // cout << endl;
    }

    for(int x = 1; x <= (n*n)/2 ; x++) {
        if(num[x]==1){  return false; }
    }

   // cout << "t" << endl;
    return true;
}
int main() {

    scanf("%d", &n);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++) {
            scanf("%d", &a[i][j]);
        }
    }

    for(int i = 1; i <= n-3; i++) {
        for(int j = 1; j <= n-3; j++) {
            for(int k = 2; k <= n-2; k++) {
                if(can(i, j, k) && k > ans_k) {
                    ans_k = k;
                    ans_i = i+1;
                    ans_j = j+1;
                }
            }
        }
    }

    cout << ans_k << " " << ans_i << " " << ans_j << endl;
    return 0;
}
