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