#include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
using vi = vector<int>;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<ll> v;
  for (int i = 0; i < 2 * n; ++i) {
    ll x;
    cin >> x;
    v.push_back(x);
  }
  sort(begin(v), end(v));
  ll sol = (v[n - 1] - v[0]) * (v[2 * n - 1] - v[n]);
  for (int i = 1; i <= n; ++i)
    sol = min(sol, (v[2 * n - 1] - v[0]) * (v[n + i - 1] - v[i]));
  cout << sol;
}
