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


struct bod {
  int x,y;
} data1[25000],data2[25000];

int cmp1(struct bod*a, struct bod*b) {
  if (a->x!=b->x)
    return a->x - b->x;
  return a->y - b->y;
}

int cmp2(struct bod*a,struct bod*b) {
  return -cmp1(a,b);
}

int n;


int main(void) {
  int i;
  while (1) {
    int valid = 1;
    int x,y;

    scanf("%d",&n);
    if (!n)
        return 0;

    for (i = 0; i < n;i++) {
      scanf("%d%d",&data1[i].x,&data1[i].y);
    }

    qsort(data1,n,sizeof(struct bod),cmp1);

    
    x = (data1[0].x + data1[n-1].x ) ;
    y = (data1[0].y + data1[n-1].y );

    for (i = 0; i < n; i++)
      if ((data1[i].x + data1[n-i-1].x != x)
          || (data1[i].y + data1[n-i-1].y != y))
        valid = 0;

    if (valid)
      printf("V.I.P. should stay at (%0.1f,%0.1f).\n",x/2.0,y/2.0);
    else
      printf ("This is a dangerous situation!\n");
  }
}