#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5 , T = N * 4;
const double EPS = 1e-10;
int n , m , a[N] , b[N];
int tot , c[T] , v[T];
double f[T] , g[T];
double S(int n , int *a , int m , int *b)
{
	double ans = 0;
	sort(a + 1 , a + n + 1);
	sort(b + 1 , b + m + 1);
	for(int i = 1 , j = 1 , k = 1 ; i <= n ; i++)
	{
		while(j <= m && a[i] > b[j])j++;
		while(k <= m && a[i] >= b[k])k++;
		ans += j - 1 + (k - j) * 0.5;
	}
	return ans / n / m;
}
bool Check(double k)
{
	double mn = 1e18 , mx = 0;
	for(int i = 1 ; i <= tot ; i++)
	{
		double a = f[i] , b = g[i] - k;
		if(a >= 0 && b <= 0)
			return 1;
		if(a < 0 && b < 0)mn = min(mn , a / b);
		if(a > 0 && b > 0)mx = max(mx , a / b);
	}
	return mn <= mx;
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0) , cout.tie(0);
	cin >> n;
	for(int i = 1 ; i <= n ; i++)cin >> a[i];
	cin >> m;
	for(int i = 1 ; i <= m ; i++)cin >> b[i];
	if(S(n , a , m , b) <= 0.5)
		swap(a , b) , swap(n , m);
	memcpy(c , a , sizeof(int) * (n + 1));
	memcpy(c + n + 1 , b + 1 , sizeof(int) * m);
	sort(c + 1 , c + n + m + 1);
	for(int i = 1 ; i <= n + m ; i++)
	{
		if(c[i] == c[i - 1])continue ;
		else 
		{
			if(c[i - 1] + 1 < c[i])
				v[++tot] = c[i - 1] + 1;
			v[++tot] = c[i];
		}
	}
	v[++tot] = 1e9 + 5;
	sort(v + 1 , v + tot + 1);
	for(int i = 1 ; i <= n ; i++)
		a[i] = lower_bound(v + 1 , v + tot + 1 , a[i]) - v;
	for(int i = 1 ; i <= m ; i++)
		b[i] = lower_bound(v + 1 , v + tot + 1 , b[i]) - v;
	for(int i = 1 ; i <= tot ; i++)
	{
		for(int j = 1 ; j <= n ; j++)
			f[i] += (i > a[j]) + 0.5 * (i == a[j]);
		f[i] = f[i] / n - 0.5;
		for(int j = 1 ; j <= m ; j++)
			g[i] += (i > b[j]) + 0.5 * (i == b[j]);
		g[i] /= m;		
	}
	double l = 0 , r = 1;
	while(fabs(l - r) > EPS)
	{
		double mid = (l + r) / 2;
		if(Check(mid))r = mid;
		else l = mid;
	}
	cout << setprecision(9) << fixed << l << " ";
	// for(int i = 1 ; i <= n ; i++)cerr << a[i] << " \n"[i == n];
	// for(int i = 1 ; i <= m ; i++)cerr << b[i] << " \n"[i == m];
	for(int i = 1 ; i <= tot ; i++)
	{
		f[i] = g[i] = 0;
		for(int j = 1 ; j <= m ; j++)
			f[i] += (i < b[j]) + 0.5 * (i == b[j]);
		f[i] = f[i] / m - 0.5;
		for(int j = 1 ; j <= n ; j++)
			g[i] += (i < a[j]) + 0.5 * (i == a[j]);
		g[i] /= n;		
		// cerr << i << ":" << f[i] << " " << g[i] << "\n";
	}
	l = 0 , r = 1;
	while(fabs(l - r) > EPS)
	{
		double mid = (l + r) / 2;
		if(Check(mid))r = mid;
		else l = mid;
	}
	cout << setprecision(9) << fixed << 1.0 - l << "\n";
	return 0;
}