Andrew went for a walk in the forest behind LHS and got lost. As he sat there waiting for help, he came up with a problem. Of course, he managed to solve it easily, can you do it too?
The forest is a 2D plane, and you are given the coordinates of \(N\) \((1 \leq N \leq 100)\) trees \((x, y)\) \((1 \leq x, y \leq 10^9)\). Your job is to find the largest number of trees that lie on the same line. Note that all coordinates are distinct.