
#include<stdio.h> 

int A[100001];

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

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