#include <stdio.h>
#include <string.h>
#include <math.h>

int x[20000];
int y[20000];
double px[20000+10000];
double py[20000+10000];
short pc[20000+10000];

int main()
{
	long i,j,k,P,N,n;
	int max,maxi;
	double tpx,tpy;
	short find;
	
	scanf("%ld\n", &N);
	while (N) {
		for (i=0; i<N; i++) {
		  scanf("%d %d\n", &x[i],&y[i]);	
		}
		P = 0;
		max = 0;
		maxi = 0;
		memset(pc, 0, sizeof(pc));
		for (i=0; i<N; i++) {
		  for (j=i+1; j<N; j++)	{
			  
			tpx=((double)(x[i]+x[j]))/2;	
			tpy=((double)(y[i]+y[j]))/2;	
			find =0;
			// hledam jestli uz mam prus.
			for (k=0;k<P;k++) {
				if (px[k]==tpx && py[k]==tpy) {
					pc[k]++;
					if (max<pc[k]) { max=pc[k]; maxi=k; }
					find = 1;
					break;
				}
			}
			// nenasel
			if (!find) {
				px[P]=tpx;
				py[P]=tpy;
				pc[P]=1;
				if (N%2==1) for (n=0; n<N; n++){
					if (tpx==x[n] && tpy==y[n]) {
						pc[P]++;
					}
				}
				if (max == 0 ) { max=pc[P]; maxi=P;}
				P++;
				
			}
		}
		}
//		printf("bodu %ld a pruseciku %ld\n", N, P);
//		printf("Nejcetnejsi prusecik: %f, %f, %dx\n", px[maxi], py[maxi], pc[maxi]);
		
		if (pc[maxi]>=N/2) {
			if (N%2==0) printf("V.I.P. should stay at (%.1f,%.1f).\n", px[maxi], py[maxi]);
			if (N%2==1) {
				find = 0;
				for (i=0;i<N;i++) {
					if (x[i]==px[maxi] && y[i]==py[maxi]) {
						find =1;
						break;
					}
				}
			        if (find) printf("V.I.P. should stay at (%.1f,%.1f).\n", px[maxi], py[maxi]); 
				else printf("This is a dangerous situation!\n");
			}
		} else printf("This is a dangerous situation!\n");
	scanf("%ld\n", &N);
	}

	return 0;
}