Under construction

Still being built. Things may change

Eight-Shaped Figures

Time limit5sMemory limit2048 MB

Summary
Count the pairs of circles that touch externally, meaning each circle lies outside the other, for n circles with integer centers and radii.
Level

Medium7 of 10

Topics
Geometry, Hash map, Math
Solved
No attempts yet

Statement

Looking at the problems "K-Shaped Figures" and "H-Shaped Figures" from the past two years, you took the warning seriously. You came prepared. For each of the remaining 24 letters of the alphabet, you theorized what the problem could be. You implemented all 24 solutions and used up your entire Digital Team Reference Document space just to bring the code to the contest. If the judges are so unoriginal that they set another problem about letter shapes, you will get it accepted in the first minute and leave everyone puzzled.

What, another shapes problem? Really?! Ha-ha! Oh... wait a second...

Two circles on a plane form an 8-shaped figure if they touch each other, but neither of them lies inside the other one.

Valid 8-shaped figuresInvalid 8-shaped figures

You are given a collection of nn circles on the plane. No two circles have more than one common point. In other words, no two circles intersect twice or coincide, but they can touch or lie one within another.

Find the number of pairs of circles from this collection that form an 8-shaped figure.

Input

Each test contains multiple test cases. The first line contains the number of test cases tt (1≤t≤1041 \le t \le 10^4). The description of the test cases follows.

The first line of each test case contains a single integer nn, the number of circles (2≤n≤2⋅1052 \le n \le 2 \cdot 10^5).

The ii-th of the following nn lines contains three integers xix_i, yiy_i, and rir_i, the coordinates of the center of the ii-th circle and its radius (−109≤xi,yi≤109-10^9 \le x_i, y_i \le 10^9; 1≤ri≤1091 \le r_i \le 10^9). No two circles intersect twice or coincide, but they can touch or lie one within another.

The sum of nn over all test cases does not exceed 2⋅1052 \cdot 10^5.

Output

For each test case, print the number of pairs of circles that form an 8-shaped figure.

Examples1

  1. Example 1

    Input
    2
    5
    1 1 1
    1 3 1
    3 1 1
    3 3 1
    6 7 4
    6
    -3 0 3
    -2 0 2
    -1 0 1
    1 0 1
    2 0 2
    3 0 3
    
    Expected output
    5
    9