#include <stdio.h>
int partition(int *, int, int);
int n;

int main()
{
  int i, A[100000], for_mark;

  scanf("%d",&n);
  
  for(i = 0 ; i < n ; i++) scanf("%d",&A[i]);

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

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

  return 0;
}

int partition(int *A, int p, int r)
{
  int x, i, j, for_change;

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

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

  return ++i;
}

