#include <iostream> #include <algorithm> using namespace std; int cmp(int a, int b) { if(a<b) return 0; return 1; } int n,i,j,k; int a[10005]; int main() { cin>>n; k=n*n; for(i=1;i<=n*n;++i) cin>>a[i]; sort(a+1,a+1+n*n,cmp); for(i=1;i<=n;++i) { for(j=1;j<=n;++j) { if(i==j) cout<<a[i]<<" "; else cout<<a[k]<<" ",--k; } cout<<'\n'; } return 0; }