#include <stdio.h>
#define N 100000
int partition(int*,int,int);
int main(){
  int n,i,q,A[N];

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

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

  for(i=0;i<n;i++){
    if(i == q){
      printf("[%d]",A[i]);
    }
    else {
      printf("%d",A[i]);
    }
    if(i != n-1)printf(" ");
  }
  printf("\n");
  return 0;
}
int partition(int A[],int p,int r){
  int x,i,j,a;
  x = A[r];
  i = p-1;
  for(j=p;j<r;j++){
    if(A[j] <= x){
      i++;
      a = A[i];
      A[i] = A[j];
      A[j] = a;
    }
            }
  a = A[i+1];
  A[i+1] = A[r];
  A[r] = a;

  return i+1;
}




