#include<stdio.h>
#include<stdlib.h>
int A[100001],n;

int Partition(int A[], int p, int r);


int main(){
  int i,m;
  
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
    
  }
  m= Partition(A,0,n-1);

  for(i=0;i<m;i++){
    printf("%d ",A[i]);
  }
  printf("[%d] ",A[m]);
  
  for(i=m+1;i<n-1;i++){
    printf("%d ",A[i]);
  }
  
  printf("%d\n",A[n-1]);


  return 0;
}


int Partition(int A[], int p,int r){
  int x,i,j,temp,temp2;

  x = A[r];
  i = p-1;

  // printf("x = %d\n",x);

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

  temp2 = A[i+1];
  A[i+1] = A[r]; 
  A[r]= temp2;  

  return i+1;
}