#include <bits/stdc++.h>
using namespace std;
long long a[100010 << 1], ans;
inline int read() {
  int sum = 0, negative = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') negative = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    sum = sum * 10 + ch - '0';
    ch = getchar();
  }
  return sum * negative;
}
int main() {
  int n = read();
  for (int i = 1; i <= n << 1; i++) a[i] = read();
  sort(a + 1, a + (n << 1) + 1);
  ans = (a[n] - a[1]) * (a[n << 1] - a[n + 1]);
  for (int i = 2; i <= n + 1; i++)
    ans = min((a[n << 1] - a[1]) * (a[i + n - 1] - a[i]), ans);
  cout << ans;
  return 0;
}
