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

int b[20000][2], n, n2, i, x, y, key[2], *found;
double dx, dy;

int compare(const void *p1, const void *p2){
	if(*((int *)p1) == *((int *)p2))
		return(*(((int *)p1) + 1) - *(((int *)p2) + 1));
	return(*((int *)p1) - *((int *)p2));
}

int main(){
	while(1){
		scanf("%d\n", &n);
		if(n == 0)
			break;
		for(x = y = i = 0; i < n; i++){
			scanf("%d %d\n", &b[i][0], &b[i][1]);
			x += b[i][0];
			y += b[i][1];
		}
		dx = (double)x / n;
		dy = (double)y / n;

		qsort(b, n, 2 * sizeof(int), compare);
		for(i = 0; i < n; i++){
			key[0] = floor(2 * dx - b[i][0] + .5);
			key[1] = floor(2 * dy - b[i][1] + .5);
			if((bsearch(key, b, n, 2 * sizeof(int), compare) == NULL)
			   || ((dx == b[i][0]) && (dy == b[i][1]))){
				printf("This is a dangerous situation!\n");
				break;
			}
			
		}
		if(i == n)
			printf("V.I.P. should stay at (%.1lf,%.1lf).\n", floor(dx + .5), floor(dy + .5));
	}
	return(0);
}