import Control.Applicative
import Control.Monad
import Control.Monad.ST
import Data.Maybe
import Data.Either
import Data.List
import Data.Array.ST
import qualified Data.ByteString.Char8 as B

unionfind :: (Int,Int) -> [Either Int (Int,Int)] -> [Int]
unionfind bounds@(lower,upper) queryList = runST $ do
  un <- newListArray bounds [lower..upper] :: ST s (STUArray s Int Int)
  let 
      f ret x = do
        t <- either find union x
        return (t:ret)
      find n        = do
        nn <- readArray un n
        if n==nn then return n else do
          nnn <- find nn
          writeArray un n nnn
          return nnn
      union (a,b)   = do
        aa <- find a
        bb <- find b
        writeArray un aa bb
        return (-1)
  filter (/= -1) <$> foldM f [] queryList

hypot2 x y = x*x+y*y

solve n ls = bsearch 0 200000000
  where
    dst = [((i,j),hypot2 (xi-xj) (yi-yj))|(i,[xi,yi])<-zip [0..] ls,(j,[xj,yj])<-zip [0..] ls,i<j]
    bsearch l r
      | l>=r      = l*10
      | check     = bsearch l c
      | otherwise = bsearch (c+1) r
        where
          c       = (l+r)`div`2
          check   = a==b
          [a,b]   = unionfind (0,n-1) $ (map (Right . fst) $ filter ((100*c*c>=).snd) dst)++(map Left [0,n-1])

main = do
  n  <- fst . fromJust . B.readInt <$> B.getLine
  ls <- replicateM n $ map (fst . fromJust . B.readInt) . B.words <$> B.getLine
  print $ solve n ls