#include <stdio.h>
#define N 100000

int partition(int *, int, int);

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

  kijyun = partition(A, 0, n-1);

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

  }
  return 0;
}

int partition(int *A, int p, int r){
  int x = 0;
  int i = 0, j = 0;
  int keep = 0;
  
  x = A[r];
  i = p-1;
  
  for(j = p; j < r; j++){
    keep = 0;
    if(A[j] <= x){
      i++;
      
      /*swap A[i] and A[j]*/
      keep = A[i];
      A[i] = A[j];
      A[j] = keep;
      
    }
  }
  
  /*swap A[i+1] and A[r]*/
  keep = 0;
  keep = A[i+1];
  A[i+1] = A[r];
  A[r] = keep;

  return i+1;
}

