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

