#include <bits/stdc++.h>
using namespace std;
const int N = 100 * 1000;
const long long int inf = (long long int)1000 * 1000 * 1000 * 1000;
int n;
long long int ary[N * 2 + 1];
void read();
long long int ans();
int main() {
  read();
  sort(ary + 1, ary + (2 * n + 1));
  cout << ans() << endl;
  return 0;
}
void read() {
  ios_base ::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 1; i <= 2 * n; i++) cin >> ary[i];
}
long long int ans() {
  if (n == 1) return 0;
  long long int minimum = inf;
  for (int i = 2; i <= n; i++) minimum = min(minimum, ary[i + n - 1] - ary[i]);
  long long int res = (ary[2 * n] - ary[1]) * minimum;
  long long int dx = ary[n] - ary[1];
  long long int dy = ary[2 * n] - ary[n + 1];
  res = min(dx * dy, res);
  return res;
}
