#include <stdio.h>
int partition(int,int);
int A[100000];

int main(){
    int n,i,result;

    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&A[i]);
    }
    result = partition(0,n-1);

    for(i=0;i<n;i++){
        if(i==result){
            printf("[%d]",A[i]);
            if(i==n-1) printf("\n");
            else printf(" "); 
            continue;
        }
        if(i<n-1) printf("%d ",A[i]);
        else printf("%d\n",A[i]);
    }
    return 0;
}

int partition(int p,int r){
    int x,i,j,tmp;

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