#include<stdio.h>
#include<stdlib.h>
#define M 100000

int A[M];

int partition(int p, int r){

  int x,i,j,k;

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

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

  return i+1;
}

int main(){

  int i,j,k,n;

  scanf("%d",&n);

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

  k =  partition(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]);
  }

  return 0;
}

