#include<iostream>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<cstdio>

#include<map>

#include<queue>

#include<vector>

using namespace std;

const int maxn=+;

int n,m;

long long a[maxn];

long long b[maxn];

bool cmp(const long long &a,const long long &b)

{

    return a>b;

}

int main()

{

    scanf("%d",&n);

    for(int i=;i<=n;i++) scanf("%lld",&a[i]);

    scanf("%d",&m);

    for(int i=;i<=m;i++) scanf("%lld",&b[i]);

    sort(a+,a++n);

    sort(b+,b++m);

    long long ans=;

    for(int i=;i<=min(m,n);i++)

    {

        if(a[i]>=) break;

        if(b[i]>=) break;

        ans=ans+a[i]*b[i];

    }

    sort(a+,a++n,cmp);

    sort(b+,b++m,cmp);

    for(int i=;i<=min(m,n);i++)

    {

        if(a[i]<=) break;

        if(b[i]<=) break;

        ans=ans+a[i]*b[i];

    }

    printf("%lld\n",ans);

    return ;

}