#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 100000;
int n;
int a[2 * MAXN];
void run() {
  scanf("%d", &n);
  for (int i = (0); i < (2 * n); ++i) scanf("%d", &a[i]);
  sort(a, a + 2 * n);
  long long ret = LLONG_MAX;
  for (int i = (0); i <= (n); ++i) {
    int dx = a[i + n - 1] - a[i];
    int dy = (i == n ? a[n - 1] : a[2 * n - 1]) - (i == 0 ? a[n] : a[0]);
    long long cur = (long long)dx * dy;
    ret = min(ret, cur);
  }
  printf("%lld\n", ret);
}
int main() {
  run();
  return 0;
}
