#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 7;
int n;
int a[maxn * 2];
long long ans = 0;
bool cmp(const int &x, const int &y) { return x < y; }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= 2 * n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a + 1, a + 2 * n + 1, cmp);
  ans = 1ll * (a[n] - a[1]) * (a[2 * n] - a[n + 1]);
  for (int i = n + 1; i <= n * 2; i++) {
    ans = min(ans, 1ll * (a[i] - a[i - n + 1]) * (a[2 * n] - a[1]));
  }
  printf("%I64d\n", ans);
  return 0;
}
