Find the minimum number of circles that you must remove so that the remaining circles do not intersect

Question

Suppose we have 3 circles

3
0 0 5
0 6 3
7 0 4

if the first two terms are the coordinates of cirlce (x, y), and the third term is the radius.

the answer is "1" we can delete the 1st circle, and the remainder of 2 will not intersect.

how to find one for n number of circles