#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
struct asshole{
    int w,t;
    bool operator < (const asshole b) const{
        return w>b.w;
    }
};
priority_queue<asshole> q;
int kz[10000],kk[10000];
int n;
void merge(int *a,int *b,int *c){
    while(!q.empty())
        q.pop();
    for(int i=1;i<=n;i++)
        q.push((asshole){a[i]+b[1],1});
    for(int i=1;i<=n;i++){
        asshole in = q.top();
        q.pop();
        a[i]=in.w;
        int pos=in.t;
        if(pos+1<=n)
            q.push((asshole){in.w-b[pos]+b[pos+1],pos+1});
    }
}
int main(){
    while(scanf("%d",&n)==1){
        for(int i=1;i<=n;i++)
            scanf("%d",&kz[i]);
        sort(kz+1,kz+n+1);
        for(int j=1;j<=n-1;j++){
        for(int i=1;i<=n;i++)
            scanf("%d",&kk[i]);
        sort(kk+1,kk+n+1);
        merge(kz,kk,kz);
        }
        for(int i=1;i<=n-1;i++)
            printf("%d ",kz[i]);
        printf("%d",kz[n]);
        printf("\n");
    }
}