#include <stdio.h>
int partition(int* , int , int );
int main(){
  int n,inx,A[100000],tmp,i;
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
  }
  inx=partition(&A[0],0,n-1);
  //tmp=A[n-1];
  //A[n-1]=A[inx];
  //A[inx]=tmp;
  for(i=0;i<inx;i++){
    if(i>0) printf(" ");
    printf("%d",A[i]);
  }
  printf(" ");
  printf("[");
  printf("%d",A[inx]);
  printf("]");
  for(i=inx+1;i<n;i++){
    printf(" %d",A[i]);
  }
  printf("\n");
  return 0;
}
int partition(int* A, int p, int r ){
  int x,i,tmp,j;
  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;
}