#include <bits/stdc++.h>
using namespace std;
long long n, a[200010];
long long ans = 1e18;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  ;
  cin >> n;
  for (int i = 1; i <= n * 2; i++) cin >> a[i];
  sort(a + 1, a + 1 + n * 2);
  ans = min(ans, (a[n * 2] - a[n + 1]) * (a[n] - a[1]));
  for (int i = n + 1; i <= n * 2 - 1; i++)
    ans = min(ans, (a[n * 2] - a[1]) * (a[i] - a[i - n + 1]));
  cout << ans;
  return 0;
}
