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