#include <iostream> #include <vector> #include <string> #include <algorithm> #include <set> #include <map> #include <cmath> #include <iomanip> #include <codecvt> #include <locale> using namespace std; using ll = long long; int main() { int n; cin >> n; vector<int> a(n); for(int i=0; i<n; ++i) { cin >> a[i]; } for(int i=1; i<2*n-3; ++i) { for(int p=0; p<=i; ++p) { int q = i-p; if(p >= n || q >= n || p >= q) { continue; } if(a[p] > a[q]) { swap(a[p], a[q]); } } } for(int i=0; i<n; ++i) { cout << a[i] << " \n"[i == n-1] << flush; } }