#include <bits/stdc++.h>
using namespace std;
#pragma warning(disable : 4996)
const double PI = acos(-1);
const long long N = 500005, md = 1e9 + 7, inf = 1e18, iinf = 1e9 + 5, MX = 3e5;
long long g, w, h, x, y, z, i, j, k, q, n, cnt, res, sum, r[N], a[N], b[N];
char c[N];
string s, t;
pair<int, int> p[N];
vector<int> e[N];
int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  cin >> n;
  for (long long i = 0; i < 2 * n; i++) cin >> a[i];
  sort(a, a + 2 * n);
  if (n == 1) cout << 0, exit(0);
  res = (a[2 * n - 1] - a[n]) * (a[n - 1] - a[0]);
  for (long long i = 1; i < n; i++)
    res = min((a[i + n - 1] - a[i]) * (a[2 * n - 1] - a[0]), res);
  cout << res;
}
