#include <bits/stdc++.h>
using namespace std;
inline long long rd() {
  register long long x = 0, w = 1;
  register char ch = 0;
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return x * w;
}
long long n, a[200010], ans, aa;
int main() {
  n = rd();
  ans = aa = 1ll << 60;
  for (int i = 1; i <= n * 2; i++) a[i] = rd();
  sort(a + 1, a + n + n + 1);
  for (int i = n; i <= n * 2; i++)
    ans = min(ans, (a[i] - a[1]) * (a[(i == n * 2) ? (n * 2 - 1) : (n * 2)] -
                                    a[(i == n) ? n + 1 : n]));
  for (int i = n + 1; i <= 2 * n - 1; i++) aa = min(aa, a[i] - a[i - n + 1]);
  ans = min(ans, aa * (a[2 * n] - a[1]));
  cout << ans;
  return 0;
}
