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