#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#pragma GCC optimize("unroll-loops")
using namespace std;
const int maxn = 2e6 + 10;
template <class T>
T mymin(const T a, const T b) {
  return a < b ? a : b;
}
template <class T>
T mymax(const T a, const T b) {
  return a > b ? a : b;
}
inline void DEBUG_REACH() { cerr << "Reach Here" << endl; }
unsigned long long a[maxn];
int main() {
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  for (int i = 1; i <= 2 * N; i++) cin >> a[i];
  sort(a + 1, a + 1 + 2 * N);
  unsigned long long ans = (a[2 * N] - a[N + 1]) * (a[N] - a[1]);
  for (int i = 2; i <= N; i++)
    ans = min(ans, (a[2 * N] - a[1]) * (a[N + i - 1] - a[i]));
  cout << ans << endl;
  return 0;
}
