#include<stdio.h>

int A[100001];
int partition(p, r)
{
  int x, i, j, tmp;
  x = A[r];
  i = p - 1;
  for(j = p; j <= r - 1; 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, q, n;
  scanf("%d", &n);
  for(i = 1; i <= n; i++)
    {
      scanf("%d", &A[i]);
    }
  q = partition(1, n);
  for(i = 1; i < n; i++)
    {
      if(q == i)
	{
	  printf("[%d] ", A[i]);
	}
      else
	{
	  printf("%d ", A[i]);
	}
    }
  printf("%d\n", A[n]);
  return 0;
}

