#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
long long int arr[maxn];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n * 2; ++i) cin >> arr[i];
  sort(arr, arr + 2 * n);
  long long int ans = 2e18;
  for (int i = n - 1; i < 2 * n - 1; ++i) {
    long long int dis = arr[i] - arr[0];
    long long int len;
    if (i != n)
      len = arr[2 * n - 1] - arr[n];
    else
      len = arr[2 * n - 1] - arr[n - 1];
    ans = min(ans, dis * len);
  }
  long long int dis = arr[2 * n - 1] - arr[0];
  for (int i = 1; i <= n; ++i) {
    ans = min(ans, dis * (arr[i + n - 1] - arr[i]));
  }
  cout << ans << endl;
  return 0;
}
