rt

#include<bits/stdc++.h>
using namespace std;
struct node{
	int x,y;
}s[100010];
double xs=1e7,ys=1e7;
int l,r;
bool fl;
bool cmp(node a,node b)
{
	return a.y>=b.y;
}
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++) cin>>s[i].x>>s[i].y;
	sort(s,s+n,cmp);
// 	if(n%2) 
// 	{
// 		cout<<"This is a dangerous situation!\n";
// 		return 0;
// 	}
	for(l=0,r=n-1;l<r;l++,r--)
	{
		double midx=(s[l].x+s[r].x)/2.00,midy=(s[l].y+s[r].y)/2.00;
//		cout<<endl<<s[l].x<<' '<<s[l].y<<'>'<<s[r].x<<' '<<s[r].y;
		if((xs!=midx||ys!=midy)&&fl)
		{
//			cout<<endl<<midx<<' '<<midy;
			cout<<"This is a dangerous situation!\n";
			return 0;
		}
		xs=midx,ys=midy,fl=1;
	}
	printf("V.I.P. should stay at (%.1f,%.1f).",xs,ys);
//	for(int i=0;i<n;i++)
//	{
//		cout<<endl<<s[i].x<<' '<<s[i].y;
//	}
}