#include <stdio.h>

int partition(int A[], int p, int r) {
    int x = A[r];
    int i = p - 1;
    int j;
    for (j = p; j < r; j++) {
        if (A[j] <= x) {
            int tmp = A[j];
            i++;
            A[j] = A[i];
            A[i] = tmp;
        }
    }
    A[r] = A[i + 1];
    A[i + 1] = x;
    return i + 1;
}

int main(void) {
    int n, i, q;
    int A[100000];
    scanf("%d", &n);
    for (i = 0; i < n; i++) scanf("%d", &A[i]);
    q = partition(A, 0, n - 1);
    for (i = 0; i < n; i++) {
        if (i) printf(" ");
        if (i == q) printf("[%d]", A[i]);
        else printf("%d", A[i]);
    }
    printf("\n");
    return 0;
}

