#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  vector<long long> a;
  for (long long i = 0; i < 2 * n; ++i) {
    long long o;
    cin >> o;
    a.emplace_back(o);
  };
  sort(a.begin(), a.end());
  long long x1 = a[0], y2 = a.back(), mul = y2 - x1, e = 1e10;
  for (long long i = 1; i < n; ++i) {
    e = min(e, a[n + i - 1] - a[i]);
  }
  cout << min(e * mul, (a[n - 1] - x1) * (y2 - a[n])) << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
}
