#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
string direc = "URDL";
const long long MOD2 = (long long)1000000007 * (long long)1000000007;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 1000000007) {
  x += y;
  if (x >= mod) x -= mod;
  if (x < 0) x += mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 1000000007) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
bitset<1200009> dp[25];
int a[60], ot[2][33];
bool del[66];
int pre[25][1200090];
void fmain(int tid) {
  scanf("%d", &n);
  for (int(i) = 1; (i) <= (int)(n + n); (i)++) scanf("%d", a + i);
  sort(a + 1, a + 1 + n + n);
  ot[0][1] = a[1];
  ot[1][n] = a[2];
  int S = 0;
  for (int i = 3; i <= n + n; i++) S += a[i];
  S /= 2;
  dp[0][0] = 1;
  for (int i = 3; i <= n + n; i++) {
    for (int j = n - 1; j >= 1; j--) {
      for (int v = S; v >= a[i]; v--) {
        if (dp[j][v]) continue;
        if (dp[j - 1][v - a[i]]) {
          dp[j][v] = 1;
          pre[j][v] = i;
        }
      }
    }
  }
  int mm = 0;
  for (int z = S; z >= 0; z--)
    if (dp[n - 1][z]) {
      mm = z;
      break;
    }
  vector<int> vp;
  for (int j = n - 1; j >= 1; j--) {
    int id = pre[j][mm];
    assert(del[id] == 0);
    vp.push_back(a[id]);
    del[id] = 1;
    mm -= a[id];
  }
  sort(vp.begin(), vp.end());
  for (int(j) = 0; (j) < (int)(n - 1); (j)++) ot[0][j + 2] = vp[j];
  vp.clear();
  for (int i = 3; i <= n + n; i++)
    if (!del[i]) vp.push_back(a[i]);
  sort(vp.begin(), vp.end());
  reverse(vp.begin(), vp.end());
  for (int(j) = 0; (j) < (int)(n - 1); (j)++) ot[1][j + 1] = vp[j];
  for (int(i) = 0; (i) < (int)(2); (i)++) {
    for (int(j) = 1; (j) <= (int)(n); (j)++) printf("%d ", ot[i][j]);
    puts("");
  }
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
