import sys

sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(1000005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
md = 10**9+7
# md = 998244353

from collections import defaultdict
from bisect import bisect_left

class UnionFind:
    def __init__(self, n):
        self.table = [-1]*n
        self.mem = [[u] for u in range(n)]
        self.cnt = n

    def root(self, u):
        stack = []
        while self.table[u] >= 0:
            stack.append(u)
            u = self.table[u]
        for v in stack: self.table[v] = u
        return u

    def same(self, u, v):
        return self.root(u) == self.root(v)

    def merge(self, u, v):
        u = self.root(u)
        v = self.root(v)
        if u == v: return False
        su = -self.table[u]
        sv = -self.table[v]
        if su < sv: u, v = v, u
        self.table[u] = -su-sv
        self.table[v] = u
        self.mem[u] += self.mem[v]
        self.mem[v].clear()
        self.cnt -= 1
        return True

    def member(self,u):
        return self.mem[self.root(u)]

    # グループの要素数
    def size(self, u):
        return -self.table[self.root(u)]

def ConvexHull(xy):
    def NG(x, y):
        x0, y0 = res[-2]
        x1, y1 = res[-1]
        return (x - x0) * (y1 - y0) - (x1 - x0) * (y - y0) >= 0

    res = []
    xy.sort()
    for x, y in xy:
        while len(res) > 1 and NG(x, y): res.pop()
        res.append((x, y))
    under_n = len(res)
    for x, y in xy[-2::-1]:
        while len(res) > under_n and NG(x, y): res.pop()
        res.append((x, y))
    return res[:-1]

def RotatingCalipers(xy):
    def dist(i,j):
        ix,iy=xy[i]
        jx, jy = xy[j]
        return (ix-jx)**2+(iy-jy)**2
    def vec(i):
        x0,y0=xy[i]
        x1,y1=xy[(i+1)%n]
        return x1-x0,y1-y0
    def outer(i,j):
        vix,viy=vec(i)
        vjx,vjy=vec(j)
        return vix*vjy-viy*vjx
    n=len(xy)
    if n<2:return 0
    if n==2:return dist(0,1)**0.5
    res=0
    i=xy.index(min(xy))
    j=xy.index(max(xy))
    si,sj=i,j
    while i!=sj or j!=si:
        res=max(res,dist(i,j))
        if outer(i,j)>0:j=(j+1)%n
        else:i=(i+1)%n
    return res**0.5

n = II()

if n < 2:
    print(n+1)
    exit()

x2y = defaultdict(list)
xy2u={}
xy=[]
for u in range(n):
    x, y = LI()
    x2y[x].append(y)
    xy2u[x,y]=u
    xy.append((x,y))

# d2+w2 <= 100
# w<=sqrt(100-d2)
pre=[]
uf=UnionFind(n)
for x in sorted(x2y):
    x2y[x].sort()
    for y,q in zip(x2y[x],x2y[x][1:]):
        if q-y>10:continue
        uf.merge(xy2u[x,y],xy2u[x,q])
    for p in pre[::-1]:
        d=x-p
        if d>10:break
        w=int((100-d**2)**0.5)
        yy=x2y[p]
        for y in x2y[x]:
            l=bisect_left(yy,y-w)
            u=xy2u[x,y]
            for q in yy[l:]:
                if q>y+w:break
                v=xy2u[p,q]
                uf.merge(u,v)
    pre.append(x)

ans=2
for uu in uf.mem:
    if len(uu)<2:continue
    cur=ConvexHull([xy[u] for u in uu])
    ans=max(ans,RotatingCalipers(cur)+2)

print(ans)