#include <bits/stdc++.h>
using namespace std;
priority_queue<long long int, vector<long long int>, greater<long long int>> ti;
vector<long long int> p[200005], q[200005], f(300005, 0), d(200005, 0);
vector<set<long long int>> b(300005);
vector<pair<long long int, long long int>> a[300005];
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int bpow(long long int a, long long int b) {
  long long int res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return res % 1000000007;
}
void fact(long long int i) {
  f[0] = 1;
  for (long long int k = 1; k <= i; k++) {
    (f[k] = f[k - 1] * k) %= 1000000007;
  }
}
long long int isprime(long long int n) {
  if (n == 1) return 0;
  for (long long int i = 2; i <= sqrt(n); i++)
    if (n % i == 0) return 0;
  return 1;
}
long long int find(long long int x) {
  if (f[x] == x)
    return x;
  else
    return f[x] = find(f[x]);
}
bool cmp(long long int x, long long int y) { return x < y; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  vector<long long int> a(2 * n + 1);
  for (long long int i = 1; i <= 2 * n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  long long int c1 = 0, mx = 0;
  for (long long int i = 1; i <= 2 * n; i++) {
    c1 = 0;
    long long int u = a[i];
    while (i <= 2 * n && u == a[i]) {
      c1++;
      i++;
    }
    i--;
    mx = max(mx, c1);
  }
  long long int ans = (a[n] - a[1]) * (a[2 * n] - a[n + 1]);
  for (long long int i = 2; i <= n; i++) {
    long long int f = (a[n + i - 1] - a[i]) * (a[2 * n] - a[1]);
    ans = min(ans, f);
  }
  cout << ans << "\n";
}
