#include <bits/stdc++.h>
#define pdd pair<double, double>
#define pdi pair<double, int>
#define inf 1000000000
///N=400
using namespace std;
///
int n, i, j, k, s, d, cnt, l, r, mid;
int flow[801][801], last[801], lft[801], rgt[801];
double outone, outall;
double cost[801][801], dlist[16001], dmin[801];
pdd plist[801];
vector<int> graph[805];
priority_queue<pdi, vector<pdi>, greater<pdi> > pq;
///
void read();
void solve();
void write();
double calc(pdd node1, pdd node2);
bool dij(double val);
bool CM(double val);
bool dfs(int node, double val);
int main()
{
    read();
    solve();
    write();
    return 0;
}
void read(){
    freopen("adapost.in", "r", stdin);
    scanf("%d", &n);
    for(i=1; i<=2*n; ++i) scanf("%lf%lf", &plist[i].first, &plist[i].second);
    fclose(stdin);
    return;
}
void solve(){
    s=0, d=2*n+1;
    for(i=1; i<=n; ++i)
    for(j=n+1; j<=2*n; ++j){
        double dist=calc(plist[i], plist[j]);
        cost[i][j]=dist;
        cost[j][i]=-dist;
        flow[i][j]=1;
        dlist[++cnt]=dist;
        graph[i].push_back(j);
        graph[j].push_back(i);
    }
    sort(dlist+1, dlist+n*n+1);
    l=1; r=n*n;
    while(r-l>1){
        mid=(l+r)/2;
        if(CM(dlist[mid])) r=mid;
        else l=mid;
    }
    for(i=1; i<=n; ++i) {
        flow[s][i]=1;
        graph[s].push_back(i);
        graph[i].push_back(s);
        flow[i+n][d]=1;
        graph[i+n].push_back(d);
        graph[d].push_back(i+n);
    }
    while(dij(outone)){
        int p, maxflow=inf;
        for(p=d; p!=s; p=last[p]) maxflow=min(maxflow, flow[last[p]][p]);
        for(p=d; p!=s; p=last[p]){
            flow[last[p]][p]-=maxflow;
            flow[p][last[p]]+=maxflow;
            outall+=cost[last[p]][p];
        }
    }
    return;
}
void write(){
    freopen("adapost.out", "w", stdout);
    printf("%fl %fl", outone, outall);
    return;
}
double calc(pdd node1, pdd node2){
    return sqrt((node1.first-node2.first)*(node1.first-node2.first)+(node1.second-node2.second)*(node1.second-node2.second));
}
bool dij(double val){
    for(i=s; i<=d; ++i) last[i]=-1, dmin[i]=inf;
    dmin[s]=0.0;
    pq.push({0, s});
    while(!pq.empty()){
        double cst=pq.top().first;
        int node=pq.top().second;
        pq.pop();
        if(node==d) continue;
        if(cst>dmin[node]) continue;
        for(auto next:graph[node]){
            if(!flow[node][next]) continue;
            if(cost[node][next]>val) continue;
            double nextc=cst+cost[node][next];
            if(nextc<dmin[next]){
                dmin[next]=nextc;
                last[next]=node;
                pq.push({nextc, next});
            }
        }
    }
    return dmin[d]!=inf;
}
bool CM(double val){
    for(i=1; i<=2*n; ++i) dmin[i]=last[i]=0;
    bool done;
    do{
        done=false;
        for(i=1; i<=n; ++i) if(!dmin[i] && dfs(i, val)) done=true;
    }while(done);
    done=true;
    for(i=1; i<=n; ++i) if(!dmin[i]) {done=false; break;}
    if(done==true) outone=val;
    return done;
}
bool dfs(int node, double val){
    for(auto next:graph[node]) if(cost[node][next]<=val && !last[next]){
        last[next]=node;
        dmin[node]=next;
        return true;
    }
    for(auto next:graph[node]) if(cost[node][next]<=val && dfs(last[next], val)){
        last[next]=node;
        dmin[node]=next;
        return true;
    }
    return false;
}