Circles
Medium
Execution time limit is 0.1 seconds
Runtime memory usage limit is 64 megabytes
Little Mykhailo has drawn N circles on a sheet of paper. Mykola mentioned that some of these circles might overlap (meaning they share at least one common point). Your task is to help Mykhailo determine if any of the circles indeed overlap.
Input
The input begins with a single natural number N, which does not exceed 10000. The next N lines each describe a circle drawn by Mykhailo. Each circle is specified by three natural numbers X_i, Y_i, R_i, where X_i and Y_i are the coordinates of the center of the i-th circle, and R_i is its radius (1 ≤ X_i, Y_i, R_i ≤ 100).
Output
The output should be the indices of two overlapping circles, separated by a space, or "0 0" if no circles overlap.
Examples
Input #1
Answer #1
Submissions 87
Acceptance rate 10%