#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const double eps = 1e-9;
long long c[200010];
int main(void) {
  int n;
  while (~scanf("%d", &n)) {
    for (int i = 1; i <= 2 * n; i++) {
      scanf("%lld", &c[i]);
    }
    sort(c + 1, c + 2 * n + 1);
    c[0] = 0;
    int cnt = 0;
    long long mn = 1e18;
    for (int i = 1; i + n <= 2 * n; i++) {
      if (i == 1) {
        mn = min(mn, (c[n] - c[1]) * (c[2 * n] - c[n + 1]));
      } else {
        mn = min(mn, (c[2 * n] - c[1]) * (c[i + n - 1] - c[i]));
      }
    }
    printf("%lld\n", mn);
  }
  return 0;
}
