#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 55;
const int inf = 1e9;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const double eps = 1e-7;
long long a[2 * MAX];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < 2 * n; i++) {
    cin >> a[i];
  }
  sort(a, a + 2 * n);
  long long mn = inf + 50, mn_indx = 0;
  long long ans = (a[2 * n - 1] - a[n]) * (a[n - 1] - a[0]);
  for (int i = 1; i < n; i++) {
    ans = min(ans, (a[i + n - 1] - a[i]) * (a[2 * n - 1] - a[0]));
  }
  cout << ans << '\n';
  return 0;
}
