Go Back
Drake Loves Kiki (100)
Description

Problem Author: Sanket Bailmare
Drake loves to compose songs. This time he decides to compose in the language and grammar of his own. He decides to construct the words dictionary which would help him to compose his song. This time when he decides to something different, he tries to impress Kiki with the lines having some pattern. He shows T cases having N words each to Kiki to impress her. She gets impressed when she sees that each word is starting with a letter same as the ending letter of preceding word.
You have to tell whether Kiki is Impressed with Drake or not.

Input

The first line of input contain an integer T denoting the number of test cases.
Each test case consists number of words N followed by space separated N words(small case) on the next line.

Output

For each test case, output a single line “impressed” if the condition is satisfied.
And “disappointed” if condition is not satisfied.

Constraints

1<=T<= 1000
2<=N<=50

Example
Copy Input

Input:
3
4
abcd defg qhij oklm
3
mcqz zqed defg
3
abcd klmn dejk
Output:
disappointed
impressed
impressed

Explanation

In test case 1 words “abcd” & “defg” satisfy the criteria but the remaining words do not satisfy hence kiki is disappointed with these words.
In test case 2 words are arranged in the order where the condition is satisfied hence kiki is impressed.
In test case 3 words can be arranged in order to meet the condition hence kiki is impressed.

Good Bye Batch 15-19
#OneLastTime Contest from Batch of 2015-19 of SIES GST



Announcement
Surprise Problem Added!
Contest is extended by 24 hours!

Problem Tags
dp, strings

Supported by our Coding Partner