#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int N = 2000 + 5;
inline long long pow_mod(long long x, long long n) {
  long long r = 1;
  while (n) {
    if (n & 1) r = (r * x) % MOD;
    x = (x * x) % MOD;
    n >>= 1;
  }
  return r;
}
inline long long pow_(long long x, long long n) {
  long long r = 1;
  while (n) {
    if (n & 1) r = (r * x);
    x = (x * x);
    n >>= 1;
  }
  return r;
}
inline void solve() {
  int n;
  cin >> n;
  int a[n << 1];
  for (int i = 0; i < n << 1; i++) cin >> a[i];
  sort(a, a + (n << 1));
  long long ans = (a[n - 1] - a[0] + 0LL) * (a[(n << 1) - 1] - a[n]);
  long long D = a[(n << 1) - 1] - a[0];
  for (int i = 0; i < n; i++) ans = min(ans, D * (a[i + n - 1] - a[i]));
  for (int i = n; i < n << 1; i++) ans = min(ans, D * (a[i] - a[i - (n - 1)]));
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t = 1;
  while (t--) solve();
}
