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

  int i,n,q;

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

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

  int i,j;
  int swap,x;

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

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

