#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, sol;
  cin >> n;
  vector<long long> a(2 * n);
  for (int i = 0; i < 2 * n; i++) cin >> a[i];
  sort(a.begin(), a.end());
  sol = (a[n - 1] - a[0]) * (a[2 * n - 1] - a[n]);
  for (int i = 1; i < n; i++)
    sol = min(sol, (a[2 * n - 1] - a[0]) * (a[i + n - 1] - a[i]));
  cout << sol << endl;
  return 0;
}
