#include<stdio.h>
int A[100000];
int partition(int p, int r){
    int i,j,t,x;
    x = A[r];
    i = p-1;
    for(j = p; j < r; j++){
        if(A[j] <= x){
            i++;
            t = A[i];
            A[i] = A[j];
            A[j] = t;
        }
    }
    t = A[i+1];
    A[i+1] = A[r];
    A[r] = t;
    return i+1;
}
 
int main(){
    int n, i, q;
     
    scanf("%d",&n);
    for(i = 0; i < n; i++) scanf("%d",&A[i]);
    q = partition(0, n-1);
    for(i = 0; i < n; i++){
        if(i == q) printf("[");
        printf("%d",A[i]);
        if(i == q) printf("]");
        if(i != n-1) printf(" ");
    }
    printf("\n");
     
    return 0;
}