#include<stdio.h>

int A[100001];

int partition(int *A,int p, int r){
  
  int x,i,j,temp,key;
  
  x = A[r];
  i = p-1;
  
  for(j=p;j<r;j++){
    if(A[j] <= x ){
      i++;
      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;
}
int main(char args[]) {
  
  int i,n,x,key;
  
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
  }
  
  key = A[n-1];
  
  partition(A,0,n-1);
  
  for(i=0;i<n-1;i++){
    if(i>0) printf(" ");
    if(key == A[i]) printf("[");
    printf("%d",A[i]);
    if(key == A[i]) printf("]");
    
  }
  if(key == A[n-1]) printf("[");
  printf("%d\n",A[n-1]);
  if(key == A[n-1]) printf("[");
  return 0;
}