#include <stdio.h>
 
int main(void) {
    int i, n, j;
    int arr[7] = {2, 3, 4, 6, 35, 55, 0}; // 将数组大小增加到足够容纳新元素，并初始化最后一个元素为0
    scanf("%d", &n);
    if (n >= arr[5]) {
        arr[6] = n; // 当n大于或等于arr[5]时，将n放在数组末尾
    } else {
        for (i = 0; i < 6; i++) {
            if (n <= arr[i]) {
                for (j = 5; j >= i; j--) {
                    arr[j + 1] = arr[j]; // 将大于等于n的元素向后移动一个位置
                }
                arr[i] = n; // 将n插入到正确的位置
                break;
            }
        }
    }
 
    for (i = 0; i < 7; i++) {
        printf("%d\n", arr[i]);
    }
    return 0;
}
 

I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbih2b2lkKSB7CiAgICBpbnQgaSwgbiwgajsKICAgIGludCBhcnJbN10gPSB7MiwgMywgNCwgNiwgMzUsIDU1LCAwfTsgLy8g5bCG5pWw57uE5aSn5bCP5aKe5Yqg5Yiw6Laz5aSf5a6557qz5paw5YWD57Sg77yM5bm25Yid5aeL5YyW5pyA5ZCO5LiA5Liq5YWD57Sg5Li6MAogICAgc2NhbmYoIiVkIiwgJm4pOwogICAgaWYgKG4gPj0gYXJyWzVdKSB7CiAgICAgICAgYXJyWzZdID0gbjsgLy8g5b2TbuWkp+S6juaIluetieS6jmFycls1XeaXtu+8jOWwhm7mlL7lnKjmlbDnu4TmnKvlsL4KICAgIH0gZWxzZSB7CiAgICAgICAgZm9yIChpID0gMDsgaSA8IDY7IGkrKykgewogICAgICAgICAgICBpZiAobiA8PSBhcnJbaV0pIHsKICAgICAgICAgICAgICAgIGZvciAoaiA9IDU7IGogPj0gaTsgai0tKSB7CiAgICAgICAgICAgICAgICAgICAgYXJyW2ogKyAxXSA9IGFycltqXTsgLy8g5bCG5aSn5LqO562J5LqObueahOWFg+e0oOWQkeWQjuenu+WKqOS4gOS4quS9jee9rgogICAgICAgICAgICAgICAgfQogICAgICAgICAgICAgICAgYXJyW2ldID0gbjsgLy8g5bCGbuaPkuWFpeWIsOato+ehrueahOS9jee9rgogICAgICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICB9CgogICAgZm9yIChpID0gMDsgaSA8IDc7IGkrKykgewogICAgICAgIHByaW50ZigiJWRcbiIsIGFycltpXSk7CiAgICB9CiAgICByZXR1cm4gMDsKfQo=

MTAw

100