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