$$$N$$$ people, numbered from $$$0$$$ to $$$N-1$$$, are taking part in the summer festival in Kamisu 66. Kamisu 66 can be represented as a coordinate plane, where $$$i$$$-th person is located at $$$(X_i, Y_i)$$$.
A set of people is said to be in a ritual formation if there exists exactly one circle for which every person in the set lies on its circumference.
Saki would like to know how many sets of people are in a ritual formation. Write a program to help Saki compute the answer, modulo $$$998\,244\,353$$$.
The input is given in the following format:
| $$$N$$$ | |
| $$$X_0$$$ | $$$Y_0$$$ |
| $$$X_1$$$ | $$$Y_1$$$ |
| $$$\vdots$$$ | |
| $$$X_{N-1}$$$ | $$$Y_{N-1}$$$ |
where $$$N$$$ is the number of people participating in the summer festival, and $$$(X_i, Y_i)$$$ is the position of the $$$i$$$-th person.
The input satisfies the following constraints:
The output should be in the following format:
| $$$R$$$ |
where $$$R$$$ is the number of sets of people in a ritual formation, modulo $$$998\,244\,353$$$.
40 00 11 01 1
5
40 01 02 03 0
0
| Название |
|---|


