#include <bits/stdc++.h>
using std::cerr;
using std::cin;
using std::max;
using std::min;
int n, A[100005 << 1];
long long ans = 1e18;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n << 1; i++) scanf("%d", &A[i]);
  std::sort(A + 1, A + 1 + n * 2);
  for (int i = 2; i <= n; i++)
    ans = min(ans, (long long)(A[i + n - 1] - A[i]) * (A[n << 1] - A[1]));
  ans = min(ans, (long long)(A[n] - A[1]) * (A[n << 1] - A[n + 1]));
  printf("%I64d\n", ans);
  return 0;
}
