#include "bits/stdc++.h" using namespace std; #define REP(i, n) for(int i=0; i<(n); i++) #define AREAS 22//22 #define DIFF 1//e4 int N; struct pos { int x, y, u; pos(int _x, int _y): x(_x), y(_y){}; }; vector ps; vector area[AREAS][AREAS]; struct unioni { int i, j, dist2; }; vector unions(22);//2222); pos areapos(pos p) { return pos(p.x / 10, p.y / 10); } int distance2(pos a, pos b) { return pow(a.x - b.x, 2) + pow(a.y - b.y, 2); } int root(int i) { if (ps[i].u == i) return i; return ps[i].u = root(ps[i].u); } void uni(pos p1, pos p2) { ps[root(p1.u)].u = ps[root(p2.u)].u; } void updateUnion(int ui, int pi) { unioni u = unions[ui]; if (u.i == -1) unions[ui].i = pi; else if (u.j == -1) unions[ui].j = pi; u = unions[ui]; if (u.i == -1 || u.j == -1) return; int disti = distance2(ps[u.i], ps[pi]); int distj = distance2(ps[u.j], ps[pi]); if (disti > u.dist2 && disti > distj) { unions[ui].j = pi; unions[ui].dist2 = disti; } else if (distj > u.dist2 && distj > disti) { unions[ui].i = pi; unions[ui].dist2 = distj; } } signed main() { cin >> N; int x, y; REP(i,unions.size()) { unions[i].i = -1; unions[i].j = -1; } double maxl = (N > 0) ? 2.0 : 1.0; REP(i,N) { cin>>x>>y; pos p = pos(x+DIFF, y+DIFF); p.u = i; ps.push_back(p); int dxy9[] = {0, 1, -1}; pos ap = areapos(p); int found = false; REP(i,9) { int nx = ap.x + dxy9[i/3]; int ny = ap.y + dxy9[i%3]; if (nx<0||2000<=nx||ny<0||2000<=ny) continue; for (pos p1 : area[nx][ny]) { if (distance2(p, p1) <= 100) { uni(p, p1); found = true; break; } } if (found) break; } area[ap.x][ap.y].push_back(ps[i]); updateUnion(ps[i].u, i); } for (unioni u : unions) maxl = max(maxl, sqrt(u.dist2) + 2); printf("%.14f\n", maxl); return 0; }