#include<stdio.h>
int partition(int A[],int p,int r);
int A[1000001];
int main(){
  int i,q,n;
  scanf("%d",&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==q)printf("[%d]",A[i]);
    else printf("%d",A[i]);
    if(i<n) printf(" ");
  }
  printf("\n");
  return 0;
}

int partition(int A[], int p,int r){
  int x,i,j,tem1,tem2;
  x = A[r];
  i = p-1;
  for (j = p ;j<r;j++){
    if (A[j] <= x){
      i = i+1;
      tem1=A[i];
      A[i]=A[j];
      A[j]=tem1;
    }
  }
      tem2=A[i+1];
      A[i+1]=A[r];
      A[r]=tem2;
       return i+1;
}