#include <stdio.h>
#define N 100000

int n,A[N];

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

  return i+1;
}

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

  q = partition(0,n-1);

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

  return 0;

}

