#include <stdio.h>

int partition(int A[100001],int p,int r){
  int x=A[r],i=p-1,j,a;
  for(j=p;j<r;j++){
    if(A[j]<=x){
      i=i+1;
      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;
}
int main(){
  int n,A[100001],q,i;
  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;
}

