#include <iostream> #include <cstdio> #include <vector> #include <algorithm> #include <utility> #include <string> using namespace std; void yuki_sort(vector<int> &v) { int n = v.size(); for (int i = 0; i < 2 * n - 3; i++) { for (int p = 0; p < n; p++) { int q = i - p; if (q < 0 || q >= n) { continue; } if (p < q && v[p] > v[q]) { swap(v[p], v[q]); } } } } int main() { int n; cin >> n; vector<int> a(n, 0); for (int i = 0; i < n; i++) { cin >> a[i]; } yuki_sort(a); for (int i = 0; i < n; i++) { if (i != 0) { cout << " "; } cout << a[i]; } cout << endl; return 0; }