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