#include <stdio.h>
#include <stdlib.h>
#define N 20200

typedef struct 
{
  int x,y;
} bod;


int n;
bod p[N];
int x,y;

int bod_cmp(const void *va, const void *vb)
{
  bod *a = (bod *) va;
  bod *b = (bod *) vb;

  if (a->x > b->x) return 1;
  if (a->x==b->x && a->y>b->y) return 1;
  return -1;
}

int main()
{
  int i;

  while(1)
  {
    scanf("%d", &n); if (n==0) break; x=0; y=0;
    for ( i=0; i<n; i++ )
    {
      scanf("%d %d", &p[i].x, &p[i].y);
      p[i].x*=2; p[i].y*=2;
      x+=p[i].x; y+=p[i].y;
    }

    if (x%n!=0 || y%n!=0) {printf("This is a dangerous situation!\n");
continue;}

    x/=n; y/=n;

    qsort(&p, n, sizeof(bod), bod_cmp);
    for ( i=0; i<n/2; i++ )
      if (p[i].x+p[n-i-1].x!=2*x || p[i].y+p[n-i-1].y!=2*y) break;

    if (i!=n/2) printf("This is a dangerous situation!\n");
    else printf("V.I.P. should stay at (%.1f,%.1f).\n", ((double) (x)/2),
((double) (y)/2));    

  }

  return 0;
}