#include<stdio.h>


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

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





int main(){
  int n;
  int i;
  int A[5000];
  int s;
   scanf("%d",&n);
  for(i = 0;i<n;i++){
    scanf("%d",&A[i]);

  }
  s = partition(A,0,n-1);//s is 配列の添字
  for(i = 0;i<n;i++){
    if(i > 0)printf(" ");
    if(i != s){
      printf("%d",A[i]);
    }
    else{
      printf("[%d]",A[i]);
    }
    
  }
  printf("\n");
 return 0;
}

