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