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

#define INF 2000000000
#define pb push_back
#define MAX 10005
#define DIM 805

struct punct {double x,y;} a[DIM>>1],v[DIM>>1];
double d[DIM>>1][DIM>>1],w[DIM*DIM>>2];
int c[DIM][DIM],f[DIM][DIM];
int l[DIM],r[DIM],t[DIM],h[DIM],poz[DIM];
double ct[DIM][DIM];
vector <int> g[DIM];
bitset <DIM> viz;
double dst[DIM];
int n,s,e,L,sol,pozi;
char buff[MAX];
queue <int> q;
double sum;

void cit (double &nr)
{
    double tmp,cnt;

    for ( ; !isdigit (buff[pozi]); )
        if (++pozi==MAX)
        {
            fread (buff,1,MAX,stdin);
            pozi=0;
        }
    for (nr=0; isdigit (buff[pozi]); )
    {
        nr=nr*10+buff[pozi]-'0';
        if (++pozi==MAX)
        {
            fread (buff,1,MAX,stdin);
            pozi=0;
        }
    }
    if (buff[pozi]=='.')
    {
        if (++pozi==MAX)
        {
            fread (buff,1,MAX,stdin);
            pozi=0;
        }
        for (tmp=0, cnt=1; isdigit (buff[pozi]); )
        {
            cnt=cnt/10;
            tmp+=cnt*(buff[pozi]-'0');
            if (++pozi==MAX)
            {
                fread (buff,1,MAX,stdin);
                pozi=0;
            }
        }
        nr+=tmp;
     }
}

void read ()
{
    int i;

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

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

    k=0;
    for (i=1; i<=n; ++i)
        for (j=1; j<=n; ++j)
            d[i][j]=w[++k]=sqrt ((a[i].x-v[j].x)*(a[i].x-v[j].x)+(a[i].y-v[j].y)*(a[i].y-v[j].y));
}

int pair_up (int nod)
{
    int i;

    if (viz[nod])
        return 0;
    viz[nod]=1;
    for (i=0; i<(int)g[nod].size (); ++i)
        if (!r[g[nod][i]])
        {
            l[nod]=g[nod][i];
            r[g[nod][i]]=nod;
            return 1;
        }
    for (i=0; i<(int)g[nod].size (); ++i)
        if (pair_up (r[g[nod][i]]))
        {
            l[nod]=g[nod][i];
            r[g[nod][i]]=nod;
            return 1;
        }
    return 0;
}

int cuplaj (double val)
{
    int i,j,ok,cup;

    for (i=1; i<=n; ++i)
    {
        g[i].clear ();
        for (j=1; j<=n; ++j)
            if (d[i][j]<=val)
                g[i].pb (j);
    }
    cup=0;
    memset (l,0,sizeof (l));
    memset (r,0,sizeof (r));
    do
    {
        ok=0;
        viz.reset ();
        for (i=1; i<=n; ++i)
            if (!l[i] && pair_up (i))
            {
                ok=1;
                ++cup;
            }
    }
    while (ok);
    if (cup!=n)
        return 0;
    return 1;
}

void bellman_ford ()
{
    int nod,i;

    for (i=s; i<=e; ++i)
    {
        dst[i]=INF;
        t[i]=0;
    }
    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 (c[nod][g[nod][i]]>f[nod][g[nod][i]] && dst[nod]+ct[nod][g[nod][i]]<dst[g[nod][i]])
            {
                dst[g[nod][i]]=dst[nod]+ct[nod][g[nod][i]];
                if (!t[g[nod][i]])
                {
                    q.push (g[nod][i]);
                    t[g[nod][i]]=1;
                }
            }
    }
    sum=(long long)dst[e];
}

inline void downheap (int nod)
{
    int fiu;

    for ( ; nod<=L; )
    {
        if ((nod<<1)<=L)
        {
            fiu=nod<<1;
            if (fiu+1<=L)
                if (dst[h[fiu+1]]<dst[h[fiu]])
                    ++fiu;
        }
        else
            return ;
        if (dst[h[nod]]>dst[h[fiu]])
        {
            poz[h[nod]]=fiu;
            poz[h[fiu]]=nod;
            swap(h[nod],h[fiu]);
            nod=fiu;
        }
        else
            return ;
    }
}

inline void upheap(int nod)
{
    int tata;

    for ( ; nod>1; )
    {
        tata=nod>>1;
        if (dst[h[tata]]>dst[h[nod]])
        {
            poz[h[nod]]=tata;
            poz[h[tata]]=nod;
            swap(h[tata],h[nod]);
            nod=tata;
        }
        else
            return ;
    }
}

inline int dijkstra ()
{
    int i,j,nrmin;

    for (i=s; i<=e; ++i)
        for (j=0; j<(int)g[i].size (); ++j)
            if (dst[i]!=INF && dst[g[i][j]]!=INF)
                ct[i][g[i][j]]+=dst[i]-dst[g[i][j]];
    for (i=s; i<=e; ++i)
    {
        t[i]=0;
        dst[i]=INF;
        poz[i]=-1;
    }
    for (dst[h[L=1]=s]=0, poz[s]=1; L; )
    {
        nrmin=h[1];
        h[1]=h[L--];
        poz[h[1]]=1;
        downheap (1);
        for (i=0; i<(int)g[nrmin].size (); ++i)
            if (c[nrmin][g[nrmin][i]]>f[nrmin][g[nrmin][i]] && dst[nrmin]+ct[nrmin][g[nrmin][i]]<dst[g[nrmin][i]])
            {
                dst[g[nrmin][i]]=dst[nrmin]+ct[nrmin][g[nrmin][i]];
                t[g[nrmin][i]]=nrmin;
                if (poz[g[nrmin][i]]!=-1)
                    upheap (poz[g[nrmin][i]]);
                else
                {
                    poz[h[++L]=g[nrmin][i]]=L;
                    upheap (L);
                }
            }
    }
    if (dst[e]!=INF)
        return 1;
    return 0;
}

double cuplaj_cost (double val)
{
    int i,j,minim;
    double cost=0;

    s=0; e=n+n+1;
    viz.reset ();
    for (i=1; i<=n; ++i)
        g[i].clear ();
    for (i=1; i<=n; ++i)
    {
        for (j=1; j<=n; ++j)
            if (d[i][j]<=val)
            {
                c[i][j+n]=1;
                ct[i][j+n]=d[i][j];
                ct[j+n][i]=-d[i][j];
                g[i].pb (j+n);
                g[j+n].pb (i);
            }
        c[s][i]=c[i+n][e]=1;
        g[s].pb (i);
        g[i].pb (s);
        g[i+n].pb (e);
        g[e].pb (i+n);
    }
    for (minim=INF; dijkstra (); minim=INF)
    {
        for (i=e; i!=s; i=t[i])
            minim=min (minim,c[t[i]][i]-f[t[i]][i]);
        for (i=e; i!=s; i=t[i])
        {
            f[t[i]][i]+=minim;
            f[i][t[i]]-=minim;
        }
        sum+=dst[e];
        cost+=minim*sum;
    }
    return cost;
}

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

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

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

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

    return 0;
}