#include <stdio.h>

int partition(int *A, int p, int r){
  int x,i,j,k;
  
  x=A[r];
  i=p-1;
  for(j=p; j<r; j++)
    if(A[j]<=x){
      i=i+1;
      k=A[i];
      A[i]=A[j];
      A[j]=k;
    }
  
  k=A[i+1];
  A[i+1]=A[r];
  A[r]=k;

  return i+1;
}

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

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

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

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

  return 0;
}
      
      
  

