==Include(page="template/taskheader" task_id="geometry")==

==Include(page="template/badtests")==
 

Ionut are $N$ segmente in planul $XY$ si si-ar dori sa stie cate perechi dintre acestea se intersecteaza. Se considera ca doua segmente se intersecteaza chiar si daca se ating intr-un singur punct.
h2. Cerinta

h2. Restrictii si precizari

* $0$ < $N$ < $500$

* $0$ < $N$ ≤ $500$

* Coordonatele capetelor segmentelor sunt toate numere intregi cuprinse intre $-10.000$ si $10.000$
h2. Exemplu
table(example). |_. geometry.in |_. geometry.out |

| 3 3

| 3

-1 -1 1 1
0 -1 0 1
-1 0 1 0
| 3 |
==Include(page="template/taskfooter" task_id="geometry")==

1319