#include<bits/stdc++.h>
using namespace std;
#define pi pair<int,int>
#define fi first
#define se second
#define db double
#define pb push_back
db ans1,ans2;
#define ll long long
ll cj(pi a,pi b){return 1ll*a.fi*b.se-1ll*a.se*b.fi;}
pi operator - (const pi &a,const pi &b){return {a.fi-b.fi,a.se-b.se};}
struct Qb{
    pi sta[500100];int typ,top;
    inline void clear(){top=0;}
    inline void ins(pi e){
        if(top&&sta[top].fi==e.fi){if(sta[top].se<=e.se)return;top--;}
        while(top>1&&cj(sta[top]-sta[top-1],e-sta[top-1])<=0)top--;
        sta[++top]=e;
    }
    inline db Ask(int X){
        for(int i=1;i<=top;i++)if(sta[i].fi==X)return sta[i].se;
        for(int i=1;i<top;i++)if(sta[i].fi<X&&X<sta[i+1].fi)
        return sta[i].se+1.0*(sta[i+1].se-sta[i].se)*(X-sta[i].fi)/(sta[i+1].fi-sta[i].fi);
        assert(0);return -1;
    }
}T1,T2;
int n,m,a[100100],b[101000];
void Sol(){
    T1.clear(),T2.clear();
    T1.typ=1,T2.typ=0;
    vector<pi>e;
    e.pb({1,-1});
    for(int i=1;i<=n;i++)e.pb({a[i],0}),e.pb({a[i]+1,0});
    for(int i=1;i<=m;i++)e.pb({b[i],1}),e.pb({b[i]+1,1});
    sort(e.begin(),e.end());
    int s1=0,s2=0,Sz=e.size();
    for(int i=0;i<Sz;i++){
        int o=e[i].se;if(o==0)s1++;if(o==1)s2++;
        if(i==Sz-1||e[i].fi!=e[i+1].fi)T1.ins({s1,s2}),T2.ins({s2,-s1});
    }
    ans1=min(ans1,1.0*T1.Ask(n)/m/2);
    ans2=max(ans2,-1.0*T2.Ask(m)/n/2);
}
int main(){
    ans1=1;
    scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);sort(a+1,a+n+1);
    scanf("%d",&m);for(int i=1;i<=m;i++)scanf("%d",&b[i]);sort(b+1,b+m+1);
    long long ss=0;
    for(int i=1;i<=n;i++){
        int t1=lower_bound(b+1,b+m+1,a[i])-b,t2=upper_bound(b+1,b+m+1,a[i])-b;
        ss+=t1-1,ss-=m-t2+1;
    }
    if(ss<0){ss=-ss;swap(n,m);for(int i=1;i<=max(n,m);i++)swap(a[i],b[i]);}
    Sol();
    printf("%.12lf %.12lf\n",ans1,ans2);
    return 0;
}