/*Partition*/
#include <stdio.h>
#include <stdlib.h>
#define N 2000001

int partition(int *, int, int);

int main(){
  int A[N];
  int k, i, j, tmp, n;

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

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

int partition(int *A, int p, int r){
  int i, j, x, tmp;
  x = A[r];
  i = p-1;

  for (j=p; j<r; 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;
}

