#include<stdio.h>
int A[100000];
int pariton(int*,int,int);
int main(){
  int n,r,x;
  int i,j;
  scanf("%d",&n);  
  for(i=0;i<n;i++) scanf("%d",&A[i]);
  x = A[n-1];
  r=partition(A,0,n-1);
  printf("%d",A[0]);
  for(i=1;i<n;i++){
    if(i == r) printf(" [%d]",A[i]);
    else printf(" %d",A[i]);
  }
  printf("\n");
  return 0;
}
  
int partition(int *A,int p,int r){
  int x,n;
  int i,j;
  int tmp1,tmp2;
  n=r;
  x = A[r];
  i = p-1;
  for(j=p;j<r;j++){
    if(A[j]<=x){
      i=i+1;
      tmp1=A[i];
      A[i]=A[j];
      A[j]=tmp1;
    }
  }
  tmp2=A[i+1];
  A[i+1]=A[r];
  A[r]=tmp2;
  return i+1;
}