#include<stdio.h>
 
int p,r;
 
int main(){
   
  int n,i,A[100000];
  int index;
 
  scanf("%d", &n);
  for(i=0;i<n;i++){
    scanf("%d", &A[i]);
  }
  index = Partition(A,0,n-1);
  for(i=0;i<n;i++){
    if(i==index) printf("[");
    printf("%d", A[i]);
    if(i==index) printf("]");
    if(i!=n-1)
    printf(" ");
  }
  printf("\n");
  return 0;
 
}
 
int Partition(int A[], int p, int r){
 
  int x,i,j;
  int Q,R;
  int k;
 
  x=A[r];
  i=p-1;
  for(j=p;j<=r-1;j++){
    if(A[j]<=x){
      i=i+1;
      Q=A[i];
      A[i]=A[j];
      A[j]=Q;
    }
  }
 
  R=A[i+1];
  A[i+1]=A[r];
  A[r]=R;
  return i+1;
}