#include <stdio.h>

int partition(int *, int , int);
int main()
{
  int n, A[100000], i, j, q;
  scanf("%d", &n);  // ??°???A??????????????¨?????´??°n
  for(i = 0; i < n; i++)
    scanf("%d", &A[i]);  // ??°???A???n??????????´?

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

int partition(int *A, int p, int r)
{
  int x, i, j, 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;
}