#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n;
  cin >> n;
  vector<long long> v(2 * n);
  for (int i = 0; i < 2 * n; i++) {
    cin >> v[i];
  }
  sort(v.begin(), v.end());
  long long ans = (v[n - 1] - v[0]) * (v[2 * n - 1] - v[n]);
  for (int i = 1; i <= n - 1; i++) {
    ans = min(ans, (v[i + n - 1] - v[i]) * (v[2 * n - 1] - v[0]));
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
}
