#include<stdio.h>

int partition(int *A, int p, int r){
  int i, j, a, x;

  a = A[r];
  i = p - 1;

  for(j = p; j < r; j++){
    if(A[j] <= a){
      i++;

      x = A[i];
      A[i] = A[j];
      A[j] = x;
    }
  }

  x = A[i + 1];
  A[i + 1] = A[r];
  A[r] = x;

  return i + 1;
}

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

  scanf("%d",&n);

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

  j = partition(A, 0, n - 1);

  for(i = 0; i < j; i++) printf("%d ",A[i]);

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

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

  printf("\n");

  return 0;
}