#include <bits/stdc++.h>
using namespace std;
const long long inf = 3e5 + 20;
long long mark[inf];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, i, j;
  cin >> n;
  n *= 2;
  long long p[n];
  for (i = 0; i < n; ++i) cin >> p[i];
  sort(p, p + n);
  long long x1 = p[0], y2 = p[n - 1], x2 = p[(n / 2) - 1], y1 = p[n / 2];
  long long ans = (x2 - x1) * (y2 - y1);
  for (i = 1; i < (n / 2); ++i) {
    long long h = (p[n - 1] - p[0]) * (p[(n / 2) + i - 1] - p[i]);
    ans = min(ans, h);
  }
  cout << ans;
  return 0;
}
