There are n circles in a 2D plane. We are given their centers and radii. We have to find the largest connected component and print its size and index of smallest circle in that component.

Constraints :

n<=100000

center(a,b) : -10000 to 10000

1<=Radius <=100