OpenKattis
CS3233 Final Team Contest Mirror

#### Start

2020-04-21 03:00 AKDT

## CS3233 Final Team Contest Mirror

#### End

2020-04-21 08:00 AKDT
The end is near!
Contest is over.
Not yet started.
Contest is starting in -392 days 9:32:18

5:00:00

0:00:00

# Problem MThe Last Problem

This is where the magic happens
This is where magic lives
Our friendships weave together stronger
The bonds grow deeper, lasting longer
And the greatest spell you’ll know
Is how the Magic of Friendship grows...

In the distant future, an older Twilight Sparkle is visited by her faithful student, Luster Dawn. Luster has always been diligent with her studies in magic, but wonders why Twilight places so much focus on friendship in the curriculum; she sees it as a distraction and a waste of time. After all, friendships take work, are complicated, and to top it all off, there’s no guarantee they’ll last. Why bother with them?

Of course, Twilight was in that position herself once, and she knows firsthoof the importance of friendship. To help Luster understand, Twilight recollects her adventures with her friends...

In these few weeks you’ve come to have an adventure of your own. You’ve experienced the glory of victory and you’ve met face-to-face with defeat. You’ve learned to work alone and you’ve learned to work together. You’ve found that sometimes the obvious approach is the correct one—and that sometimes you’ll need to put in a bit more effort to find a solution. You’ve solved countless problems and the fact that you’re still here, after weeks of the most trying challenges, is a powerful testament to your exemplary ability and resilience. But there’s one last problem for you to solve: saying goodbye.

By the end of these five hours, you will be walking your separate ways, having taken all that we have had to offer. Goodbyes are always bittersweet, especially when they’re said to close friends and mentors. Perhaps we can make this one sting a little less?

## Input

The first and only line of input contains a single string $S$ ($1 \leq |S| \leq 50$), the name of the one you will bid farewell to.

It is guaranteed that $S$ contains only lowercase and uppercase Latin alphabet characters and spaces, does not contain two consecutive spaces and its first and last characters are not spaces.

## Output

Output a single line containing the string Thank you, $S$ , and farewell!, where $S$ is the name of the one you will bid farewell to.

Sample Input 1 Sample Output 1
Twilight

Thank you, Twilight, and farewell!

Sample Input 2 Sample Output 2
Luster

Thank you, Luster, and farewell!