#include <stdio.h>
#include <stdlib.h>

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

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

  scanf("%d", &n);

  A = (int *)malloc(n * sizeof(int));

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

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

  for(i = 0; i < q; i++)
    {
      printf("%d ", A[i]);
    }
  printf("[%d] ", A[q]);
  for(i = q + 1; i < n - 1; i++)
    {
      printf("%d ", A[i]);
    }
  printf("%d\n", A[n - 1]);

  return 0;
}