#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

double solve(vector<pair<ll, ll>> A) {
    int N = A.size();
    double gx = 0, gy = 0;
    for (int i = 0; i < N; i++) {
        gx += A[i].first;
        gy += A[i].second;
    }
    gx /= N;
    gy /= N;
    double res = 0;
    for (int i = 0; i < N; i++) {
        double val = hypot(A[i].first - gx, A[i].second - gy);
        res = max(res, val);
    }
    return res;
}

int main() {
    int N;
    cin >> N;
    vector<pair<ll, ll>> A(N), B(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i].first >> A[i].second;
    }
    for (int i = 0; i < N; i++) {
        cin >> B[i].first >> B[i].second;
    }

    printf("%.10f\n", solve(B) / solve(A));
}