#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define abs(ca) ((ca)>0?(ca):-(ca))
int porovnej(const int *a,const int *b)
{
  if (*a==*b) {return (*(a+1)-*(b+1));}
  else{  return (*a-*b);}
}



int main()
{
double tezx=0,tezy=0,pom,pom2,EPS=0.00001;
long int n,pole[20002][2],i,j;
scanf("%d",&n);
while (n!=0){
  tezx=tezy=0;
  for(i=0;i<n;i++){scanf("%d%d",&pole[i][0],&pole[i][1]);}
  qsort(pole,n,2*sizeof(int),*porovnej);
  i=0;
  j=n-1;
  tezx=(double)(pole[0][0]+pole[n-1][0])/2;
  tezy=(double)(pole[0][1]+pole[n-1][1])/2;
  while (i<=j)
  {
    pom=(double)(pole[i][0]+pole[j][0])/2;
    pom2=(double)(pole[i][1]+pole[j][1])/2;
    if (abs(pom-tezx)>EPS){goto ne;};
    if (abs(pom2-tezy)>EPS){goto ne;};
    i++;j--;
  } 
  printf("V.I.P. should stay at (%.1f,%.1f).\n",tezx,tezy);
  goto k;
  ne:
  printf("This is a dangerous situation!\n");
  k:
  scanf("%d",&n);
}

return 0;
}