{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eVasya is a good boy, but he has a bad habit: he smokes. All the time that Petya is Vasya\u0027s friend, he\u0027s been trying to cure Vasya of this habit. But he never succeeded, because Vasya doesn\u0027t want to leave off smoking.\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eRecently 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\u0027t 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.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eA cigarette is a segment with non-zero length. The first line contains the number of cigarettes on Vasya\u0027s table \u003ci\u003eN\u003c/i\u003e (1 ≤ \u003ci\u003eN\u003c/i\u003e ≤ 50000). The next \u003ci\u003eN\u003c/i\u003e lines describe the cigarettes: in the (\u003ci\u003ei\u003c/i\u003e + 1)st line there are integers \u003ci\u003ex\u003csub\u003e1\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003ey\u003csub\u003e1\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003ex\u003csub\u003e2\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003ey\u003csub\u003e2\u003c/sub\u003e\u003c/i\u003e, which are the coordinates of the ends of the \u003ci\u003ei\u003c/i\u003eth cigarette (–10000 ≤ \u003ci\u003ex\u003csub\u003e1\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003ey\u003csub\u003e1\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003ex\u003csub\u003e2\u003c/sub\u003e\u003c/i\u003e, \u003ci\u003ey\u003csub\u003e2\u003c/sub\u003e\u003c/i\u003e ≤ 10000).\u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eIf 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 \u003ci\u003ei\u003c/i\u003e and \u003ci\u003ej\u003c/i\u003e, where \u003ci\u003ei\u003c/i\u003e is the number of the cigarette that must be taken away, and \u003ci\u003ej\u003c/i\u003e is the number of the intersecting cigarette.\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eIf Petya can take away no cigarettes, then output “NO”.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n0 0 2 2\r\n0 2 2 0\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eYES\r\n1 2\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003cbr\u003e\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n0 0 0 5\r\n5 0 5 10\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eNO\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}