A desert island Robinson Crusoe and his companion Friday live on has a shape of a non-degenerate triangle which vertices are points (x₁, y₁), (x₂, y₂), (x₃, y₃). Once Robinson and Friday fell aboard and decided to divide the island into two equal parts by choosing two points on the island coast and connecting them with a line segment. These parts were to have the same area and shore length. Robinson failed to choose these points. Can you do it for him?

The only line of the input contains space-separated integers x₁, y₁, x₂, y₂, x₃, y₃, not exceeding 2000 in absolute value.

If there is a line segment ST, which divides the island into two parts of the same area and shore length, output “YES” on the first line of the output, S coordinates on the second line, and T coordinates of the third line. S and T should be located on the island shore. Coordinates should be accurate within 10⁻⁹. If there is no such line segment, output “NO” on a single line.