#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
int ar[MAXN * 2 + 5];
int main(int argc, char** argv, char** envp) {
  int N;
  scanf("%d", &N);
  for (int i = 0; i < 2 * N; i++) {
    scanf("%d", ar + i);
  }
  sort(ar, ar + 2 * N);
  long long has = (long long)(ar[N - 1] - ar[0]) * (ar[2 * N - 1] - ar[N]);
  for (int i = N; i < 2 * N; i++) {
    has =
        min(has, (long long)(ar[i] - ar[i - N + 1]) * (ar[2 * N - 1] - ar[0]));
  }
  printf("%lld\n", has);
}
