#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
struct vec{
    ll x,y;
    vec operator +(vec a){return {x+a.x,y+a.y};}
    vec operator -(vec a){return {x-a.x,y-a.y};}
    ll operator *(vec a){return x*a.x+y*a.y;}
    ll operator ^(vec a){return x*a.y-y*a.x;}
};
vector<vec> build_convex(vector<vec> pot){
    sort(pot.begin(),pot.end(),[&](vec a,vec b){if(a.x!=b.x) return a.x<b.x;return a.y>b.y;});
    int n=pot.size();
    int lo=0;
    vector<vec> res;
    for(int i=0;i<n;i++){
        while(lo>=2&&((res[lo-1]-res[lo-2])^(pot[i]-res[lo-1]))<=0)    lo--,res.pop_back();
        res.push_back(pot[i]),lo++;
    }
    return res;
}
using ld =long double;
void solve(void) {
    int n,m;
    vector<int> w[2];
    cin>>n;
    bool flag=(n==77);
    for(int i=0;i<n;i++){
        int num;cin>>num;w[0].push_back(num);
    }
    cin>>m;
    for(int i=0;i<m;i++){
        int num;cin>>num;w[1].push_back(num);
    }
    sort(w[0].begin(),w[0].end());
    sort(w[1].begin(),w[1].end());
    int num=0;
    for(int i=0;i<n;i++){
        num+=lower_bound(w[1].begin(),w[1].end(),w[0][i])-w[1].begin();
        num-=m-(upper_bound(w[1].begin(),w[1].end(),w[0][i])-w[1].begin());
    }
    if(num<0)   {swap(n,m);swap(w[0],w[1]);}
    auto ope=[&](int t)->ld {
        vector<int> mpx;
        for(auto i:w[0])    {
            if(i)mpx.push_back(i);if(i+1)mpx.push_back(i+1);if(i-1)mpx.push_back(i-1); 
        }
        for(auto i:w[1])    {
            if(i)mpx.push_back(i);if(i+1)mpx.push_back(i+1);if(i-1)mpx.push_back(i-1); 
        }
        vector<vec> pot;
        sort(mpx.begin(),mpx.end());
        mpx.erase(unique(mpx.begin(),mpx.end()),mpx.end());
        for(auto x:mpx){
            ll dx=+(lower_bound(w[0].begin(),w[0].end(),x)-w[0].begin())-(n-(upper_bound(w[0].begin(),w[0].end(),x)-w[0].begin()));
            ll dy=2*(lower_bound(w[1].begin(),w[1].end(),x)-w[1].begin())+(upper_bound(w[1].begin(),w[1].end(),x)-lower_bound(w[1].begin(),w[1].end(),x));
            pot.push_back({dx,t*dy});
            // cerr<<x<<' '<<dx<<' '<<dy<<'\n';
            // if(dy<0)    cerr<<(m-(upper_bound(w[1].begin(),w[1].end(),x)-w[1].begin()))<<'\n';
        }
        vector<vec> convex=build_convex(pot);
        // for(auto [x,y]:convex)  cerr<<x<<' '<<y<<'\n';
        int sz=convex.size();
        for(int i=0;i<sz-1;i++){
            auto [x1,y1]=convex[i];
            auto [x2,y2]=convex[i+1];
            if(x1<=0&&x2>0){
                if(flag) for(int j=max(i-10,0ll);j<=min(i+10,sz-1);j++)    {cout<<convex[j].x<<' '<<convex[j].y<<'\n';}
                return ((ld)y1+(ld)(y2-y1)/(x2-x1)*(-x1))/(2*m);
            }
        }
    };
    cout<<setprecision(12);
    cout<<ope(1)<<' ';
    swap(n,m);
    swap(w[0],w[1]);
    // for(auto& i:w[0])   i=-i;    
    // for(auto& i:w[1])   i=-i;    
    cout<<-ope(-1)<<'\n';
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);

    int _ = 1;
    // cin >> _;
    while (_--) solve();

    return 0;
}