#include<cstdio>

 #include<algorithm>

 #include<iostream>

 using namespace std;

 const int maxn=;

 int coupon1[maxn],coupon2[maxn];

 int product1[maxn],product2[maxn];

 bool cmp(int a,int b){

     return a>b;

 }

 int main(){

     int n,m,c1=,c2=,p1=,p2=;

     long long cx,px,ans=;

     scanf("%d", &n);

     for(int i=;i<n;i++){

         scanf("%lld",&cx);

         if(cx>=) {

             coupon1[c1++]=cx;

         }

         else {

             coupon2[c2++]=cx;

         }

     }

     scanf("%d",&m);

     for(int i=;i<m;i++){

         scanf("%lld",&px);

         if(px>=) {

             product1[p1++]=px;

         }

         else {

             product2[p2++]=px;

         }

     }

     sort(coupon1,coupon1+c1,cmp);

     sort(coupon2,coupon2+c2);

     sort(product1,product1+p1,cmp);

     sort(product2,product2+p2);

     for(int i=;i<c1;i++){

         ans+=coupon1[i]*product1[i];

     }

     for(int i=;i<c2;i++){

         ans+=coupon2[i]*product2[i];

     }

     printf("%lld",ans);

     return ;

 }