#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e18 + 7;
const long pp = 2e5 + 100;
int n;
long long a[pp], ans;
int getbit(int bit, int ii) { return (bit >> ii) & 1; }
long long get(long long x1, long long y1, long long x2, long long y2) {
  return (long long)(x2 - x1) * (y2 - y1);
}
void input() {
  cin >> n;
  for (int i = (1); i <= (2 * n); ++i) cin >> a[i];
  sort(a + 1, a + 2 * n + 1);
  ans = mod;
  for (int i = (1); i <= (n); ++i) {
    int l = i;
    int r = i + n - 1;
    if (l == 1)
      ans = min(ans, get(a[l], a[r + 1], a[r], a[2 * n]));
    else if (r == 2 * n)
      ans = min(ans, get(a[l], a[1], a[r], a[l - 1]));
    else
      ans = min(ans, get(a[l], a[1], a[r], a[2 * n]));
  }
  cout << ans;
}
void output() {}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie();
  cout.tie();
  input();
  output();
  return 0;
}
