# include <algorithm>
void sort(unsigned * a, int n) {
for (int i = 1, t = n / 2; i < n; i *= 2, t = 3 * t / 4) {
for (int j = 0; j < n - t; j++) {
if (a[j] > a[j + t]) {
std::swap(a[j], a[j + t]);
}
}
}
for (int i = n - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (a[j] > a[j + 1]) {
std::swap(a[j], a[j + 1]);
}
}
}
}