#include<stdio.h>

int partition(int *,int ,int );

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

  scanf("%d",&n);

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

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

  for(i = 0; i < m; i++){
    printf("%d ",A[i]);
  }

  printf("[%d] ",A[m]);

  for(i = m+1; i < n; i++){
    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,kari;

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

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

  kari = A[i+1];
  A[i+1] = A[r];
  A[r] = kari;

  return i+1;
}

