package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
)

type xy struct {
	x int
	y int
}

func isLink(a, b, c, d int) bool {
	return 100 >= (c-a)*(c-a)+(d-b)*(d-b)
}

func distance(a, b, c, d int) float64 {
	x := math.Sqrt(float64((c-a)*(c-a) + (b-d)*(b-d)))
	return x
}

func main() {
	sc.Split(bufio.ScanWords)

	var N int
	//fmt.Scan(&N)
	N = nextInt()
	repeater := make([]xy, N)
	for i := 0; i < N; i++ {
		//fmt.Scan(&repeater[i].x, &repeater[i].y)
		repeater[i].x = nextInt()
		repeater[i].y = nextInt()
	}
	uf := NewUnionFind(N)
	for i := 0; i < N; i++ {
		for j := i; j < N; j++ {
			if isLink(repeater[i].x, repeater[i].y, repeater[j].x, repeater[j].y) {
				uf.Unit(i, j)
			}
		}
	}
	ans := 1.0
	for i := 0; i < N; i++ {
		for j := 0; j < N; j++ {
			if uf.Same(i, j) {
				ans = max(ans, 2+distance(repeater[i].x, repeater[i].y, repeater[j].x, repeater[j].y))
			}
		}
	}
	fmt.Println(ans)
}

func max(a, b float64) float64 {
	if a > b {
		return a
	} else {
		return b
	}
}

type UnionFind struct {
	par    []int // 親
	weight []int // 重み
}

func NewUnionFind(count int) *UnionFind {
	par := make([]int, count)
	weight := make([]int, count)
	for i := 0; i < count; i++ {
		par[i] = i
		weight[i] = 1
	}
	return &UnionFind{par: par, weight: weight}
}

func (uf *UnionFind) Find(x int) int {
	if uf.par[x] == x {
		return x
	} else {
		uf.par[x] = uf.par[uf.par[x]]
		return uf.Find(uf.par[x])
	}
}

func (uf *UnionFind) Unit(x, y int) {
	x = uf.Find(x)
	y = uf.Find(y)
	if x == y {
		return
	}
	if uf.weight[x] > uf.weight[y] {
		x, y = y, x
	}
	uf.par[x] = y
	uf.weight[y] += uf.weight[x]
}

func (uf *UnionFind) Same(x, y int) bool {
	return uf.Find(x) == uf.Find(y)
}

func (uf UnionFind) test() {
	fmt.Println(uf.weight)
}

var sc = bufio.NewScanner(os.Stdin)

func nextLine() string {
	sc.Scan()
	return sc.Text()
}

func nextInt() int {
	i, _ := strconv.Atoi(nextLine())
	return i
}