#include <stdio.h>
#define N 100000

int A[N];

int partition(int A[], int p, int r){
  int i, j, x, temp1, temp2;

  x = A[r];
  i = p-1;
  for(j=p; j<r; j++){
    if(A[j]<=x){
      i = i+1;
      temp1 = A[i];
      A[i] = A[j];
      A[j] = temp1;
    }
  }
  temp2 = A[i+1];
  A[i+1] = A[r];
  A[r] = temp2;
  return i+1;
}

int main(){

  int i, n, x, ans;

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

  x = A[n-1];
  ans = partition(A, 0, n-1);

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

  return 0;
}