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

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