#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
priority_queue<int, vector<int>, greater<int> > pq;
vector<int> v;
queue<int> q;
deque<int> dq;
int vec[200000];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n * 2; i++) scanf("%d", &vec[i]);
  sort(vec, vec + 2 * n);
  long long xs = vec[n - 1] - vec[0], ys = vec[2 * n - 1] - vec[n];
  long long miv = xs * ys;
  ys = vec[2 * n - 1] - vec[0];
  for (int i = n; i < 2 * n - 1; i++) {
    xs += vec[i] - vec[i - 1];
    xs -= vec[i - n + 1];
    xs += vec[i - n];
    miv = min(miv, xs * ys);
  }
  printf("%lld", miv);
}
