#include <bits/stdc++.h>
using namespace std;
const int N = 3e2 + 5;
map<long long, long long> mp;
vector<pair<long long, long long> > v;
vector<pair<long long, long long> >::iterator it;
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n, p, ans = 1e18 + 5;
  ;
  cin >> n;
  p = n;
  n *= 2;
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  sort(a, a + n);
  for (int i = 0; i < n; i++) {
    if (i + p == n) break;
    long long l = a[i + p - 1] - a[i];
    long long b;
    if (i == 0)
      b = a[n - 1] - a[p];
    else
      b = a[n - 1] - a[0];
    ans = min(ans, l * b);
  }
  cout << ans;
  return 0;
}
