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