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