#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstring>

#define N 20009

using namespace std;

int n;

struct W{

    double x,y;

}w[N];

bool cmp(W a,W b){

    if(a.x==b.x)return a.y<b.y;

    return a.x<b.x;

}

int main(){

    scanf("%d",&n);

    for(int i=;i<=n;i++){

        scanf("%lf%lf",&w[i].x,&w[i].y);

    }

    sort(w+,w+n+,cmp);

    double xx=(w[].x+w[n].x)/2.0;

    double yy=(w[].y+w[n].y)/2.0;

    for(int i=;i<=n;i++){

        if(n-i+<=i)break;

        double tx=(w[i].x+w[n-i+].x)/2.0;

        double ty=(w[i].y+w[n-i+].y)/2.0;

        if(tx!=xx||ty!=yy){

            printf("This is a dangerous situation!\n");

            return ;

        }

    }

    printf("V.I.P. should stay at (%.1lf,%.1lf).",xx,yy);

    return ;

}