#include <stdio.h>

int Partition(int*,int,int);

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

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

  mid = Partition(A,0,n-1);

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

  return 0;
}

int Partition(int* A,int p,int r){
  int x;
  int tmp,j,i;
  x = A[r];
  i = p-1;
  for(j = p; j < r; j++){
    if(A[j] <= x){
      i = i + 1;
      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;
}