Tudor is going for a walk!
In this scenario, Tudor has
The goats are rather territorial, so Tudor's initial assignment of rope lengths to goats ensures that two goats can never interact with each other, not even at a single point.
Compute the maximum number of goats that Tudor can check on given that he can choose what line to travel on.
Constraints
In tests worth 5 marks,
Input Specification
The first line of input will contain a single positive integer,
Each of the next
Output Specification
Output, on a single line, the maximum number of goats Tudor can visit.
Sample Input
3
0.00 0.00 1.00
3.00 0.00 1.00
3.00 3.00 1.00
Sample Output
2
Comments
Question unclear. Is the "line" Tudor travelling on always a horizontal/vertical line? Or can it be any straight lines on a grid?
What is unclear about the question?
Does the problem statement give any constraints on the form of the infinite line?