#include <bits/stdc++.h>
using namespace std;

struct node {
    int val;
    struct node* next;
    node(int val) : val(val), next(nullptr) {}
};

node* insert(node* head, int n) {
    node* r = new node(n);
    node* p = head;

    // 找到插入位置
    while (p->next != nullptr && p->next->val <= n) {
        p = p->next;
    }

    // 插入新节点
    r->next = p->next;
    p->next = r;

    return head;
}

void print(node* head) {
    node* p = head->next;
    while (p != nullptr) {
        cout << p->val << " ";
        p = p->next;
    }
    cout << endl;
}

void freeList(node* head) {
    node* p = head;
    while (p != nullptr) {
        node* temp = p;
        p = p->next;
        delete temp;
    }
}

int main() {
    int n;
    while (cin >> n) {
        node* head = new node(-1);  // 哨兵节点
        while (n--) {
            int x;
            cin >> x;
    ...