#include <stdio.h>
#define N 100000

int partition(int A[], int p, int r)
{
  int x,i,j,tmp;

  x = A[r];
  i = p - 1;
  for(j=p; j<=r-1; 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,i,q;
  int 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-1; i++){
    if(i == q)
      printf("[%d] ",A[i]);

    else
    printf("%d ",A[i]);
  }
  printf("%d\n",A[n-1]);

  return 0;
}
