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

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

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

}
  chg=A[i+1];
  A[i+1]=A[r];
  A[r]=chg;
return i+1;
}

