#include<stdio.h>

#define N 100000

int partition(int [], int, int);

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

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

  for(j=p; j<r; j++){
    if(A[j] <= x){
      i = i+1;
      change = A[i];
      A[i] = A[j];
      A[j] = change;
    }
  }
    change = A[i+1];
    A[i+1] = A[r];
    A[r] = change;

  return i+1;
}

int main(){
  int n, A[N];
  int i, par;

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

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

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

  return 0;
}

