CF 397 A. Neverending competitions

A. Neverending competitions

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

There are literally dozens of snooker competitions held each year, and team Jinotega tries to attend them all (for some reason they prefer name "snookah")! When a competition takes place somewhere far from their hometown, Ivan, Artsem and Konstantin take a flight to the contest and back.

Jinotega's best friends, team Base have found a list of their itinerary receipts with information about departure and arrival airports. Now they wonder, where is Jinotega now: at home or at some competition far away? They know that:

• this list contains all Jinotega's flights in this year (in arbitrary order),
• Jinotega has only flown from his hometown to a snooker contest and back,
• after each competition Jinotega flies back home (though they may attend a competition in one place several times),
• and finally, at the beginning of the year Jinotega was at home.

Please help them to determine Jinotega's location!

Input

In the first line of input there is a single integer n: the number of Jinotega's flights (1 ≤ n ≤ 100). In the second line there is a string of 3capital Latin letters: the name of Jinotega's home airport. In the next n lines there is flight information, one flight per line, in form "XXX->YYY", where "XXX" is the name of departure airport "YYY" is the name of arrival airport. Exactly one of these airports is Jinotega's home airport.

It is guaranteed that flights information is consistent with the knowledge of Jinotega's friends, which is described in the main part of the statement.

Output

If Jinotega is now at home, print "home" (without quotes), otherwise print "contest".

Examples

input

4
SVO
SVO->CDG
LHR->SVO
SVO->LHR
CDG->SVO

output

home

input

3
SVO
SVO->HKT
HKT->SVO
SVO->RAP

output

contest

Note

In the first sample Jinotega might first fly from SVO to CDG and back, and then from SVO to LHR and back, so now they should be at home. In the second sample Jinotega must now be at RAP because a flight from RAP back to SVO is not on the list.

题目大意是说：这里有个被称做“snooker”的比赛每年都会举行，由于举办地点离Jinotega 的家乡很远，所以他们只能座飞机去比赛。

Jinotega 的好朋友看到了Jinotega 今年一年的飞机票，格式为 XXX-->YYY（出发地，目的地，长度都为3的单词）然你求现在Jinotega 是在家还是在比赛。

其中要注意的是：

1.所有机票都是今年的。

2.所有机票都是Jinotega 往返比赛的时候的。

3.每次比完赛Jinotega 都要先回家才能进行下场比赛。

4.每年结束时Jinotega 在家里。

其实这是一个特别水的题，分析分析，你会发现只要记录下机票上Jinotega 的家乡出项几次就可以了，因为每年的开始Jinotega 都在家，如果他在家，Jinotega 家乡出现的次数必定为偶数，因为必定为 “home”-->“contest”    “contest”-->“home”成立，所以，用map标记下Map[home]出现的次数，然后求奇偶性就可以了。出现的次数为奇数Jinotega 就在比赛，为偶数Jinotega 就在家。

#include <iostream>
#include <map>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;
map<string,int >Map;
int main(){
	int n;
	scanf("%d",&n);
	char home[20];
	scanf("%s",home);
	while(n--){
		char str[20],ch[20];
		scanf("%s",str);
		for(int i = 0; i < 3; i++)
			ch[i] = str[i];
		ch[3] = '\0';
		Map[ch]++;
		for(int i = 5; i < 8; i++)
			ch[i-5] = str[i];
		ch[8] = '\0';
		Map[ch]++;
	}
	
	if(Map[home]%2 == 0)
		cout<<"home"<<endl;
	else
		cout<<"contest"<<endl;
	return 0;
}