program symmetry; var N,i,j:integer; p : array[1..30000] of longint; top,bottom : integer; sx,sy:real; k,l,px,py: longint; chyba:boolean; stred:longint; procedure qsort(zac,kon : integer); var x,q,i,j : longint; begin i:=zac; j:=kon; x:=p[(zac+kon) div 2]; repeat while p[i]x do dec(j); if ij; if zac0 do Begin top:=1; bottom:=1; for i:=1 to n do begin readln(px,py); p[i]:=k*(px+l)+py+l; end; qsort(1,n); stred:=p[1]+p[n]; j:=1;chyba:=false; while j<=((n+1) div 2) do begin if (p[j]+p[n-j+1])<>stred then chyba:=true; inc(j); end; if chyba then writeln('This is a dangerous situation!') else begin sx:= ((stred div k)/2-l); sy:= ((stred mod k)/2-l); if abs(sx)<0.1 then sx:=0; if abs(sy)<0.1 then sy:=0; writeln('V.I.P. should stay at (',sx:0:1,',',sy:0:1,').'); end; readln(n); End; End.