#include <stdio.h>
#define N 100000

int partition(int *,int,int);

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

int partition(int A[],int p,int r){
  int tmp,j;
  int  x=A[r];
  int i = p-1; //partition ( A, p, r )　配列 A[ p..r ] 
  for(j=p;j<=r-1;j++){
    if(A[j]<=x){
      i++;
      tmp =A[j];
     A[j]=A[i];
     A[i]=tmp;
     }
 } tmp =A[i+1];
     A[i+1]=A[r];
     A[r]=tmp;
     return i+1;
}



