Vasya is a good boy, but he has a bad habit: he smokes. All the time that Petya is Vasya's friend, he's been trying to cure Vasya of this habit. But he never succeeded, because Vasya doesn't want to leave off smoking.
Recently Petya invented a new way to cure his friend. Vasya is a sloven, so his cigarettes are not in a pack but lie scattered on a big table. Petya wants to take away one cigarette every day so that Vasya wouldn't notice it. Petya wants to take away a cigarette that intersect other cigarettes on the table. Help Petya to determine if he can start to implement his plan.
Input
A cigarette is a segment with nonzero length. The first line contains the number of cigarettes on Vasya's table N (1 ≤ N ≤ 50000). The next N lines describe the cigarettes: in the (i + 1)st line there are integers x_{1}, y_{1}, x_{2}, y_{2}, which are the coordinates of the ends of the ith cigarette (–10000 ≤ x_{1}, y_{1}, x_{2}, y_{2} ≤ 10000).
Output
If Petya can start to implement his plan, then in the first line you should output the word “YES”, and the second line should contain numbers i and j, where i is the number of the cigarette that must be taken away, and j is the number of the intersecting cigarette.
If Petya can take away no cigarettes, then output “NO”.
Samples
input  output 

2
0 0 2 2
0 2 2 0
 YES
1 2

2
0 0 0 5
5 0 5 10
 NO

Problem Author: Ilya Shishkov
Problem Source: Ural SU and Orel STU Contest. Petrozavodsk Summer Session, August 2006