#include<stdio.h>
#include<stdlib.h>

int partition(int *, int, int);

int main(){

  int n,r,i,*A,p;

  scanf("%d",&n);

  A = malloc(sizeof(int)*n); 

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

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

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

  return 0;

}


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;

}