#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;

#define INF 2000000000
#define pb push_back
#define mp make_pair
#define sc second
#define fs first
#define DIM 405

struct punct {double x,y;} a[DIM],v[DIM];
vector <pair <int,double> > g[DIM];
int c[DIM][DIM],f[DIM][DIM];
double w[DIM*DIM],dst[DIM];
int t[DIM],viz[DIM];
double sol,nrt;
queue <int> q;
int n,m,s,d;

void read ()
{
    int i;

    scanf ("%d",&n);
    for (i=1; i<=n; ++i)
        scanf ("%lf%lf",&a[i].x,&a[i].y);
    for (i=1; i<=n; ++i)
        scanf ("%lf%lf",&v[i].x,&v[i].y);
}

double distanta (punct a,punct b)
{
    return sqrt ((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

void init ()
{
    int i,j,k;

    s=k=0; d=2*n+1;
    for (i=1; i<=n; ++i)
        for (j=1; j<=n; ++j)
        {
            w[++k]=distanta (a[i],v[j]);
            c[s][i]=c[i][j+n]=c[j+n][d]=1;
            g[s].pb (mp (i,0));
            g[i].pb (mp (s,0));
            g[i].pb (mp (j+n,w[k]));
            g[j+n].pb (mp (i,-w[k]));
            g[j+n].pb (mp (d,0));
            g[d].pb (mp (j+n,0));
        }
}

int bellman_ford (double val)
{
    int i,nod;

    memset (t,0,sizeof (t));
    for (i=s; i<=d; ++i)
        dst[i]=INF;
    dst[s]=0;
    for (q.push (s); !q.empty (); q.pop ())
    {
        viz[nod=q.front ()]=0;
        for (i=0; i<(int)g[nod].size (); ++i)
            if (g[nod][i].sc<=val)
                if (dst[nod]+g[nod][i].sc<dst[g[nod][i].fs] && c[nod][g[nod][i].fs]>f[nod][g[nod][i].fs])
                {
                    dst[g[nod][i].fs]=dst[nod]+g[nod][i].sc;
                    t[g[nod][i].fs]=nod;
                    if (!viz[g[nod][i].fs])
                    {
                        q.push (g[nod][i].fs);
                        viz[g[nod][i].fs]=1;
                    }
                }
    }
    if (dst[d]==INF)
        return 0;
    return 1;
}

double cuplaj (double val)
{
    int nrmin,i,cup;
    double cost;

    cup=0;
    cost=0;
    memset (f,0,sizeof (f));
    for (nrmin=INF; bellman_ford (val); nrmin=INF)
    {
        for (i=d; i!=s; i=t[i])
            nrmin=min (nrmin,c[t[i]][i]-f[t[i]][i]);
        for (i=d; i!=s; i=t[i])
        {
            f[t[i]][i]+=nrmin;
            f[i][t[i]]-=nrmin;
        }
        if (nrmin)
        {
            cost+=dst[d];
            ++cup;
        }
    }
    if (cup!=n)
        return INF;
    return cost;
}

void solve ()
{
    int st,dr,mij;
    double nrc;

    nrt=INF-1;
    sort (w+1,w+n*n+1);
    for (st=1, dr=n*n; st<=dr; )
    {
        mij=(st+dr)/2;
        nrc=cuplaj (w[mij]);
        if (nrc<=nrt)
        {
            nrt=nrc;
            sol=w[mij];
            dr=mij-1;
        }
        else
            st=mij+1;
    }
    printf ("%lf %lf",sol,nrt);
}

int main ()
{
    freopen ("adapost.in","r",stdin);
    freopen ("adapost.out","w",stdout);

    read ();
    init ();
    solve ();

    return 0;
}