#include<stdio.h>
int partition(int[],int,int);

int main(){
  int i,j,n,A[100000],k;
  scanf("%d",&n);
  for(i=0;i<n;i++){
    scanf("%d",&A[i]);
  }
  k = partition(A,0,n-1);
  for(i=0;i<n;i++){
    if(i)printf(" ");
    if(i==k){
      printf("[");
    }
    printf("%d",A[i]);

    if(i==k){
      printf("]");
    }
  }
  printf("\n");
  return 0;
}

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

