{"problem":{"name":"K. MaratonIME bot","description":{"content":"As you probably already know, all members of MaratonIME use Telegram to communicate, for its amazing web and desktop apps, its bots and, of course, its stickers. As time goes by, members eventually g","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":2000,"memory_limit":65536},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10137K"},"statements":[{"statement_type":"Markdown","content":"As you probably already know, all members of MaratonIME use Telegram to communicate, for its amazing web and desktop apps, its bots and, of course, its stickers.\n\nAs time goes by, members eventually graduate and leave the group, a sad event for all. Victor \"Sena\" Sena, a member of MaratonIME, is tired of countless goodbyes, and has decided to do something about the void that fills his noble soul.\n\nSena realized that people in Brazil are becoming more and more alike, expressing themselves in the same way, with expressions like \"kk eae men\", \"ata\" and \"zapzap\". The members of MaratonIME are very similar as well, but they use different expressions.\n\nPeculiarly, whenever someone asks a question, everyone answers \"7\". This is a tradition, from unknown origins, passed on by Germano \"Germs\" UnionFind. Besides, whenever someone says a sentence (that is not a question) and he mentions the dear member Gabriel \"Sussu\" Fernandes, all members yell in unison \"AI SUSSU!\". For any other sentence that doesn't fit any of these rules, the answer is \"O cara é bom!\" (this guy is good).\n\nFiguring out these patterns, and using his incredible knowledge of software engineering, Sena decided to create a Telegram bot that simulates retired members of MaratonIME. He developed the whole platform, he just need the part that prints the answer for a given sentence, can you help him?\n\nIt has been agreed that a sentence is a question if it's last character is _?_. Also, it is only said that there was a mention to Sussu's great name if one of the words in the sentence is exactly _Sussu_.\n\nThe input consists of a single sentence, that is, a non-empty line, with space-separated words (strings with lower or upper case letters). The last character is always one among _._, _!_ and _?_. The line has at most 200 characters.\n\nPrint what a MaratonIME member would answer to that sentence. \n\n## Input\n\nThe input consists of a single sentence, that is, a non-empty line, with space-separated words (strings with lower or upper case letters). The last character is always one among _._, _!_ and _?_. The line has at most 200 characters.\n\n## Output\n\nPrint what a MaratonIME member would answer to that sentence. \n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ S $ be a non-empty string representing a sentence, with words separated by spaces, ending in one of $ \\{ \\text{.}, \\text{!}, \\text{?} \\} $.  \nLet $ W = (w_1, w_2, \\dots, w_n) $ be the sequence of words in $ S $, obtained by splitting on spaces.  \nLet $ \\text{lastchar}(S) $ denote the final character of $ S $.  \n\n**Constraints**  \n1. $ \\text{lastchar}(S) \\in \\{ \\text{.}, \\text{!}, \\text{?} \\} $  \n2. $ |S| \\leq 200 $  \n3. Each word $ w_i $ consists only of alphabetic characters (lower or upper case).  \n\n**Objective**  \nOutput:  \n- $ \\texttt{\"7\"} $, if $ \\text{lastchar}(S) = \\text{?} $  \n- $ \\texttt{\"AI SUSSU!\"} $, if $ \\text{lastchar}(S) \\neq \\text{?} $ and $ \\exists\\, w_i \\in W $ such that $ w_i = \\texttt{\"Sussu\"} $  \n- $ \\texttt{\"O cara é bom!\"} $, otherwise","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10137K","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}