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