#include <stdio.h>
#include <stdlib.h>

int quickSort(int *,int,int);
int partition(int *,int,int);

int main()
{
  int *A,n,i,p=0,r,x,q;

  scanf("%d",&n);

  A = (int *)malloc(n * sizeof(int));

  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
  }

  r = n-1;
  
  q = quickSort(A,p,r);

  for(i=0;i<n;i++){
    if(i==q) printf("[%d]",A[i]);
    else printf("%d",A[i]);
    if(i<n-1) printf(" ");
    else printf("\n");
  }

  free(A);

  return 0;
}

int quickSort(int *A,int p,int r)
{
  int q;
  
  /* if(p<r){ */
    q = partition(A,p,r);
    /*  quickSort(A,p,q-1);
	quickSort(A,q+1,r); 
	} */

  return q;
}

int partition(int *A,int p,int r)
{
  int x,i,cmp,j;

  x = A[r];
  i = p-1;

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

  return i+1;
}
    

