#include <stdio.h>
int partition(int, int);
int A[100000];
 
int main(){
  int i, p, n, c;

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

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

  return 0;
}

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