eolymp
bolt
Try our new interface for solving problems
Problems

Osipovsky Cup

Osipovsky Cup

Before the start of the International Open Contest "Osipovsky Cup", coach Dmitry decided to choose a training place for his team. He does not want to offend anybody - he wants to choose a place equidistant to homes of all \textbf{3} teammates. Dmitry is a very busy man, so he asks you to help him. \InputFile The input contains \textbf{6} integer numbers (\textbf{x_1}, \textbf{y_1}, \textbf{x_2}, \textbf{y_2}, \textbf{x_3}, \textbf{y_3}) - the coordinates of homes of \textbf{3} teammates. All coordinates are different. Their absolute values do not exceed \textbf{1000}. \OutputFile If the place exists, output it's coordinates, separated by spaces. If the place does not exist, output "\textbf{NO}". The coordinates' precision should be \textbf{5} digits after decimal point.
Time limit 0.5 seconds
Memory limit 64 MiB
Input example #1
-2 2 2 -2 1 5
Output example #1
1.5000000000 1.5000000000
Author Плоткин Артем