#include<stdio.h>

#define MAX 100000

/*1 partition(A, p, r)
2   x = A[r]
3   i = p-1
4   for j = p to r-1
4     if A[j] <= x
5       i = i+1
6       A[i] と A[j] を交換
7   A[i+1] と A[r] を交換
8   return i+1*/
int partition(int A[], 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 A[MAX], i, q, n;

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

  for(i = 0; i < n; i++){
    if(i) printf(" ");
    if(i == q) printf("[");

    printf("%d", A[i]);

    if(i == q) printf("]");
  }
  printf("\n");
  return 0;
}

