#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int N=1005;
int n,a[N][N],f[N],g[N];
void BellaKira()
{
    cin>>n;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
            cin>>a[i][j],f[i]+=a[i][j],g[j]+=a[i][j];
    if (n<=4)
    {
        for (int i=1;i<=n;i++)
            for (int j=1;j<=n;j++)
                for (int x=1;x<=n;x++)
                    for (int y=1;y<=n;y++)
                        if (i!=x||j!=y)
                        {
                            f[i]-=a[i][j],g[j]-=a[i][j];
                            f[x]-=a[x][y],g[y]-=a[x][y];
                            swap(a[i][j],a[x][y]);
                            f[i]+=a[i][j],g[j]+=a[i][j];
                            f[x]+=a[x][y],g[y]+=a[x][y];
                            bool bl=1;
                            for (int k=1;k<=n;k++) bl&=(f[k]==f[1]&&g[k]==f[1]);
                            if (!bl) 
                            {
                                f[i]-=a[i][j],g[j]-=a[i][j];
                                f[x]-=a[x][y],g[y]-=a[x][y];
                                swap(a[i][j],a[x][y]);
                                f[i]+=a[i][j],g[j]+=a[i][j];
                                f[x]+=a[x][y],g[y]+=a[x][y];
                                continue;
                            }
                            cout<<i<<" "<<j<<" "<<x<<" "<<y<<'\n';
                            return;
                        }
        return;
    }
    map<int,int>Mp;
    for (int i=1;i<=n;i++) Mp[f[i]]++,Mp[g[i]]++;
    int p=0;
    for (auto [u,v]:Mp)
        if (v>Mp[p])
        {
            p=u;
        }
    poly gx,gy;
    for (int i=1;i<=n;i++)
        if (f[i]!=p) gx.push_back(i);
    for (int i=1;i<=n;i++)
        if (g[i]!=p) gy.push_back(i);
    for (int i:gx)
        for (int j:gy)
            for (int x:gx)
                for (int y:gy)
                    if (i!=x||j!=y)
                    {
                        f[i]-=a[i][j],g[j]-=a[i][j];
                        f[x]-=a[x][y],g[y]-=a[x][y];
                        swap(a[i][j],a[x][y]);
                        f[i]+=a[i][j],g[j]+=a[i][j];
                        f[x]+=a[x][y],g[y]+=a[x][y];
                        bool bl=1;
                        for (int k=1;k<=n;k++) bl&=(f[k]==f[1]&&g[k]==f[1]);
                        if (!bl) 
                        {
                            f[i]-=a[i][j],g[j]-=a[i][j];
                            f[x]-=a[x][y],g[y]-=a[x][y];
                            swap(a[i][j],a[x][y]);
                            f[i]+=a[i][j],g[j]+=a[i][j];
                            f[x]+=a[x][y],g[y]+=a[x][y];
                            continue;
                        }
                        cout<<i<<" "<<j<<" "<<x<<" "<<y<<'\n';
                        return;
                    }

    
                                
                            
}
signed main()
{
	IOS;
	cin.tie(0);
	int T=1;
	while (T--)
	{
		BellaKira();
	}
}