#include <stdio.h>
int partition(int *, int, int);
  int A[100000];
int main(){
  int i,n,j;
  scanf("%d",&n);
 
  for(i=0;i<n;i++) scanf("%d",&A[i]);
  
  j=partition(A,0,n-1);
  for(i=0;i<j;i++)
    printf("%d ",A[i]);
    printf("[%d] ",A[j]);
for(i=j+1;i<n-1;i++)
    printf("%d ",A[i]);
  printf("%d\n",A[n-1]);

return 0;


}
int partition(int A[], int p, int r){
  int x,i,j,c;

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

    }  

}
 
 c=A[i+1]; 
      A[i+1]=A[r];
      A[r]=c ; 




 return i+1;



}