#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
long long i, j, k, l, n, m, p, q, r, d, su, sx, sy,
    prod = 1, maxi, a, b, c, w, x, y, o, e, f, mini = 1000000000, t, cnt;
string s, s1, s2;
long long ar[100005], val[5000];
long long modularExponentiation(long long x, long long n) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return modularExponentiation((x * x) % 998244353, n / 2);
  else
    return (x * modularExponentiation((x * x) % 998244353, (n - 1) / 2)) %
           998244353;
}
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  if (a.first == b.first)
    return (a.second < b.second);
  else
    return (a.first > b.first);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int ti = 1;
  while (ti--) {
    vector<long long> v;
    cin >> n;
    for (long long i = 0; i < 2 * n; i++) {
      cin >> x;
      v.push_back(x);
    }
    sort(v.begin(), v.end());
    if (n == 1) {
      cout << "0";
      return 0;
    }
    mini = (v[n - 1] - v[0]) * (v[2 * n - 1] - v[n]);
    for (long long i = 1; i < n; i++) {
      x = (v[2 * n - 1] - v[0]) * (v[n - 1 + i] - v[i]);
      mini = min(x, mini);
    }
    cout << mini;
  }
  return 0;
}
