#include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>
// #include "Src/Utility/BinarySearch.hpp"
// #include "Src/Sequence/CompressedSequence.hpp"
// #include "Src/Sequence/RunLengthEncoding.hpp"
// using namespace zawa;
// #include "atcoder/modint"
// using mint = atcoder::modint998244353;
int N;
long double x[10000000], y[10000000], z[10000000], w[10000000];
long double sum_x = 0, sum_y = 0, sum_z = 0, sum_w = 0;
int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cout.tie(nullptr);
    std::cin >> N;
    for (int i = 0 ; i < N ; i++) {
        std::cin >> x[i] >> y[i];
        sum_x += x[i];
        sum_y += y[i];
    }
    for (int i = 0 ; i < N ; i++) {
        std::cin >> z[i] >> w[i];
        sum_z += z[i];
        sum_w += w[i];
    }
    sum_x /= N;
    sum_y /= N;
    sum_z /= N;
    sum_w /= N;
    long double p = 0, q = 0;
    for (int i = 0 ; i < N ; i++) {
        long double dx = x[i] - sum_x, dy = y[i] - sum_y;
        p = std::max(p, dx*dx+dy*dy);
    }
    for (int i = 0 ; i < N ; i++) {
        long double dx = z[i] - sum_z, dy = w[i] - sum_w;
        q = std::max(q, dx*dx+dy*dy);
    }
    long double ans = sqrtl(q/p);
    std::cout << ans << '\n'; 
}