#include <stdio.h>
int A[100000];

int partition(int p, int r){
  int x,i,j,tr;
  x = A[r];
  i = p-1;
  for (j = p; j <= r-1; j++){
    if (A[j] <= x){
      i = i+1;
      tr = A[i];
      A[i] = A[j];
      A[j] = tr;
    }
  }
    tr = A[i+1];
    A[i+1] = A[r];
    A[r] = tr;
    return i+1;
}

int main(){

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

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