Problems
Integer point
Integer point
The vertices of triangle have integer coordinates. Find any point with integer coordinates strictly inside the triangle. A point must not belong to the boundary of a triangle.
Input
Contains three lines with two integers in each line: xi
, yi
(-106
≤ xi
, yi
≤ 106
) - the coordinates of triangle vertices. It is guaranteed that the triangle is non-degenerate.
Output
If there is no required point, print "No". Otherwise print two integers - the coordinates of any point strictly inside the triangle.
Input example #1
0 0 3 0 1 2
Output example #1
1 1
Input example #2
0 0 0 1 1 0
Output example #2
No