#include <bits/stdc++.h>
const int N = 1e5 + 5;
using namespace std;
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) {
      res = (res * x) % 1000000007;
    }
    x = (x * x) % 1000000007;
    y = y >> 1;
  }
  return res;
}
std::vector<int> divi[100004];
void divisor(int n) {
  for (int i = 1; i <= n; i++) {
    for (int j = i; j <= n; j += i) {
      divi[j].push_back(i);
    }
  }
}
int prime[10004];
void seive(int n) {
  for (int i = 2; i <= n; i++) {
    if (!prime[i]) {
      for (int j = 2 * i; j <= n; j += i) {
        prime[j] = 1;
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, x;
  cin >> n;
  long long int a[2 * n];
  for (int i = 0; i < 2 * n; i++) {
    cin >> a[i];
  }
  sort(a, a + 2 * n);
  long long int ans = (a[2 * n - 1] - a[n]) * (a[n - 1] - a[0]);
  for (int i = n - 1; i > 0; i--) {
    long long int val = a[2 * n - 1] - a[i];
    long long int index = n;
    val = val * (a[n] - a[0]);
    ans = min(ans, val);
  }
  long long int val = a[2 * n - 1] - a[0];
  for (int i = 1; i < n; i++) {
    long long int x = val;
    x = x * (a[n + i - 1] - a[i]);
    ans = min(ans, x);
  }
  cout << ans << endl;
  return 0;
}
