#include <algorithm> #include <functional> #include <iostream> #include <vector> using namespace std; int n, sqr; vector<int> v; int main() { cin >> n; sqr = n * n; for (int i = 0; i < sqr; ++i) { int x; cin >> x; v.push_back(x); } sort(v.begin(), v.end(), greater<int>()); for (int i = 0; i < n; ++i) swap(v[i], v[i * n + i]); for (int i = 0; i < sqr; ++i) { if (!(i % n) && i) cout << '\n'; cout << v[i] << ' '; } return 0; }