#include <bits/stdc++.h>
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 5;
using namespace std;
long long a[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ;
  memset(a, 0, sizeof(a));
  int n;
  cin >> n;
  for (int i = 1; i <= 2 * n; i++) cin >> a[i];
  sort(a + 1, a + 1 + 2 * n);
  long long ans = (a[n] - a[1]) * (a[2 * n] - a[n + 1]);
  for (int i = 1; i <= n; i++) {
    ans = min(ans, (a[i + n - 1] - a[i]) * (a[2 * n] - a[1]));
  }
  cout << ans << endl;
}
