import sys,heapq input = sys.stdin.buffer.readline n=int(input()) par=[-1]*n def find(x): if par[x]<0: return x else: par[x]=find(par[x]) return par[x] def unite(x,y): x=find(x) y=find(y) if x==y: return False else: if par[x]>par[y]: x,y=y,x par[x]+=par[y] par[y]=x return True def same(x,y): return find(x)==find(y) def size(x): return -par[find(x)] import heapq XY=[] for _ in range(n): XY.append(tuple(int(i) for i in input().split())) Q=[] def f(x1,y1,x2,y2): dist2=(x2-x1)**2+(y2-y1)**2 dist=int(dist2**0.5) while dist**2