No smoking!
Vasyl is a good friend, but he has a bad habit—he smokes. Over the years, Petro has tried to help Vasyl quit smoking, but without success, as Vasyl is not willing to stop.
Recently, Petro devised a plan to help his friend quit. Vasyl is quite disorganized, so his cigarettes are scattered across a large table instead of being neatly packed. Petro wants to discreetly remove a few cigarettes each day without Vasyl noticing. Vasyl won't notice if no more than one cigarette goes missing per day. Additionally, Petro should only take a cigarette if it intersects with another one on the table. Help Petro determine if he can begin executing his plan.
Input
Each cigarette is represented as a line segment of non-zero length. The first line contains the integer N (1 ≤ N ≤ 125000), which indicates the number of cigarettes on Vasyl's table. The following N lines provide the details of each cigarette: the (i + 1)-th line contains the coordinates of the endpoints of the i-th cigarette, given as integers x_1, y_1, x_2, y_2 (–10000 ≤ x_1, y_1, x_2, y_2 ≤ 10000).
Output
On the first line, print "YES" if Petro can start his plan. On the second line, print the numbers i and j: i is the number of the cigarette Petro should take, and j is the number of the cigarette it intersects with.
If Petro cannot take any cigarette, print "NO".