#include <bits/stdc++.h>
using namespace std;
long long n, i, j, a[500000], ans = 2e18;
signed main() {
  scanf("%lld", &n);
  for (i = 1; i <= 2 * n; i++) scanf("%lld", &a[i]);
  sort(a + 1, a + 1 + 2 * n);
  ans = (a[n] - a[1]) * (a[2 * n] - a[n + 1]);
  for (i = 1; i <= n; i++) {
    ans = min(ans, (a[i + n - 1] - a[i]) * (a[n * 2] - a[1]));
  }
  printf("%lld", ans);
  return 0;
}
