#include<stdio.h>

int partition(int*, int, int);

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

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

