#include<stdio.h>

#define M 100000

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

}

int n;
int A[M];

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

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

