#include <stdio.h>

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

int main(){
  int n,q;
  int A[100000];

  while(scanf("%d",&n) != EOF){
    for(int i=0;i<n;i++){
      scanf("%d",&A[i]);
    }
    q = partition(A,0,n-1);
    for(int i=0;i<n;i++){
      if(A[i] == q)
        printf("[%d]\n",A[i]);
      else
        printf("%d\n",A[i]);
    }
  }
  return 0;
}

