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