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

