#include <iostream>#include<vector>#include<algorithm>usingnamespacestd;
int node[1003],a[1003],n;
int k = 0;
//感觉一定要记住下面这种方法void create_tree(int i)
{
if (i >= n)
{
cout << "i"<<i<<endl;
return;
}
int left = 2 * i + 1, right = 2 * i + 2;
if (left < n)
create_tree(left);
a[i] = k++;
if (right < n)
create_tree(right);
}
int main()
{
cin >> n;
create_tree(0);
for (int i = 0; i < n; i++)
{
cin >> node[i];
}
sort(node, node + n);
for (int i = 0; i < n; i++)
{
if (i == n - 1)
cout << node[a[i]] << endl;
elsecout << node[a[i]] << " ";
}
return0;
}