T1

#include <iostream>
using namespace std;
struct pos//坐标
{
    int x;
    int y;
};
int map[205][205];
int n;
pos a[205];
int juge(int i, int k)//判断是否长度相等
{
    int length = (i - a[1].x) * (i - a[1].x) + (k - a[1].y) * (k - a[1].y);//第一个国家与传入点的距离
    for (int j = 2; j <= n; j++)
    {
        if (length != (i - a[j].x) * (i - a[j].x) + (k - a[j].y) * (k - a[j].y))
            return 0;
    }
    return 1;//都相等则返回1否则返回0
}
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)//输入国家坐标
        cin >> a[i].x >> a[i].y;
    for (int i = 1; i <= 200; i++)
        for (int k = 1; k <= 200; k++)
            if (juge(i, k))//如果到所有国家距离相等则输出坐标终止函数
            {
                cout << i << " " << k;
                return 0;
            }
    cout << "War is cruel.";//否则输出War is cruel.
}