|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|3 초||256 MB||1||1||1||100.000%|
One-hundred and fifty years ago, Ezra Cornell and A. D. White hosted a party in the newly opened Cornell University. They were at the door greeting people as they came, and they also made notes of who was coming in. This party was very peculiar in that a guest could pass through the door several times, and by doing so, would be counted by Cornell and White multiple times. They were very smart men, so knowing that this could happen, they mentally assigned a number to each invited guest, so every time a guest entered the door both Cornell and White would make note of the ID of that guest. They had very good memory, so they wouldn’t write the ID down at the moment a guest comes in. As a consequence, their lists not necessarily are in the order of arrival.
At the end they compared their notes and realized they were completely different. They immediately understood what was going on. Cornell and White assigned different IDs for the same person. While Cornell would say that John Smith is person 5, White would say that he is person 8, for example. They are not convinced that this was their only mistake, though. Can you help them?
Your task is to tell Cornell and White if their only mistake was to give different IDs to the same person, or if one of them got something wrong. For instance, if Cornell’s list is: “1 3 1” and White’s list is “5 5 6”, it can be the case that Cornell’s person 1 is White’s person 5, and Cornell’s person 3 is White’s person 6. In this case their only mistake was using different IDs. On the other hand if the lists are “1 1 1” and “1 2 3” there is no way that they didn’t make any other mistake.
The input consists of several test cases. The input starts with the number of test cases. Each test case starts with the number N of names in the lists. The following line will contain all the N numbers in Cornell’s list, and the next line will contain all the N numbers in White’s list. 1 ≤ N ≤ 100,000, and each number inside the lists is between 1 to 1,000,000 (inclusive).
For each test case, your output should be “what a lovely party” in case their only mistake was to give different IDs or “you’ve messed up, Cornell”, otherwise.
3 3 1 2 1 5 5 6 3 1 1 1 1 2 3 5 11 12 13 14 15 11 12 13 14 15
what a lovely party you've messed up, Cornell what a lovely party