/*
TASK:marriage
LANG:C++
*/
#include<iostream.h>
#include<math.h>
long int a[100][100];
int main ()
{ int n,i,j,k,b,u,dev,br,br1,b1,u1,prov;
cin>>n;
b1=a[0][0];
u1=a[n][0];
br1=b1+u1;
prov=0;
k=(n+n);
for (i=1;i<k+1;i++)
for (j=1;j<n+1;j++) cin >>a[i][j];
 for (i=1;i<n+1;i++)
  {   cout<<i<<" ";
   for ( j=1;j<n+1;j++)
    {
    b=a[i][j];
    u=a[j+n][i];
    br=b+u;
    if (br<br1)br=br1;
    else br1=br;
    }
    if (i==(n-1)) u=u+1;
    if (i==n) u=u-1;
    if (b!=prov) cout<<u<<endl;
    else cout<<"0"<<endl;
    prov=b;
   }
return 0;
}