#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector")
using namespace std;
int a[(int)2e5 + 10];
int main() {
  int n, i;
  cin >> n;
  for (i = 0; i < 2 * n; i++) {
    scanf("%d", &a[i]);
  }
  sort(a, a + n * 2);
  long long ans = (long long)1e18 + 100;
  for (i = 0; i < n; i++) {
    ans = min(ans, (long long)(a[n - 1 + i] - a[i]) *
                       (a[2 * n - 1] - (i ? a[0] : a[n])));
  }
  cout << ans;
}
