#include using namespace std; using ll = long long; using Graph = vector>; vector> X(1000, vector(1000)); int main() { int N; cin >> N; int ma = 0; for(int i = 0; i < N; i++){ int x; cin >> x; ma = max(ma,x); for(int j = 0; j > z; X[i][j] = z; } } vector A(ma); for(int i = 0; i < N; i++) { for(int j = 0; j < X[i].size(); j++){ A[j]++; } } vector ans; for(int i = 0; i < ma; i++) { for(int j = 0; j < N; j++) { if(X[j][i] != 0) { ans.push_back(X[j][i]); } } } for(int i = 0; i < ans.size(); i++) { if(ans.size() - 1 == i) { cout << ans[i] << endl; return 0; } cout << ans[i] << " "; } }