문제<\/h2>
Looking at 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 even implemented all 24 solutions and used up all of your Digital Team Reference Document space just to bring these codes to the contest. If the judges are so unoriginal that they set another problem about letter shapes, you'll just get it accepted on minute 1 and leave everyone puzzled.<\/em><\/p>
What, another shapes problem? Really?! Ha-ha! Oh... wait a second...<\/em><\/p>
Let's say that two circles on a plane form an 8-shaped figure<\/em> if they touch each other, but neither of them lies inside the other one.<\/p>

[이미지 1]<\/span><\/td> [이미지 2]<\/span><\/td> <\/tr>
Valid 8-shaped figures<\/td> Invalid 8-shaped figures<\/td> <\/tr> <\/tbody> <\/table>
You are given a collection of $n<\/mi><\/mrow>n<\/math><\/span><\/span> n<\/span><\/span><\/span><\/span> 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.<\/p> Find the number of pairs of circles from this collection that form an 8-shaped figure.<\/p> 입력<\/h2> Each test contains multiple test cases. The first line contains the number of test cases t<\/mi><\/mrow>t<\/math><\/span><\/span> t<\/span><\/span><\/span><\/span> (1<\/mn>\leq<\/mo>t<\/mi>\leq<\/mo>10<\/mn>4<\/mn><\/msup><\/mrow>1 \le t \le 10^4<\/math><\/span><\/span> 1<\/span> <\/span> \leq<\/span> <\/span><\/span> <\/span> t<\/span> <\/span> \leq<\/span> <\/span><\/span> <\/span> 1<\/span> 0<\/span>$

Eight-Shaped Figures