#include<stdio.h>
int partition(int [], int, int);

int n;
int main()
{
  int i,q,A[100000];

  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!=0) printf(" ");
     if(i==q) printf("[");
     printf("%d",A[i]);
      if(i==q) printf("]");
  }
  printf("\n");

  return 0;
}

int partition(int A[], int p, int r){
  int x,i,j,temp1,temp2;

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

  return i+1;
}

