{"raw_statement":[{"iden":"statement","content":"Programming contests are fun! So fun in fact, that you find yourself browsing online through hundreds of programming-related tasks, checking if they are about competitive programming. As quite a few of those tasks were not what you were looking for, you were wondering if you could write a program that classifies the problems for you!\n\nYou figured out that the following classification works every time: If the task description mentions \"ACM\", then the task is about competitive programming and will thus be very fun to solve. Otherwise, the task is not.\n\nYou are given the task description, consisting of only uppercase letters of the Latin alphabet (_A_ through _Z_). It is guaranteed that there will be at least one and at most 106 characters.\n\nPrint \"_Fun!_\" if the statement contains _ACM_, and \"_boring..._\" otherwise.\n\n"},{"iden":"input","content":"You are given the task description, consisting of only uppercase letters of the Latin alphabet (_A_ through _Z_). It is guaranteed that there will be at least one and at most 106 characters."},{"iden":"output","content":"Print \"_Fun!_\" if the statement contains _ACM_, and \"_boring..._\" otherwise."},{"iden":"examples","content":"InputSWISSSUBREGIONALACMICPCOutputFun!InputXXXAXCXMXXXOutputboring..."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ S $ be a string over the alphabet $ \\{A, B, \\dots, Z\\} $, with $ 1 \\leq |S| \\leq 10^6 $.\n\n**Constraints**  \n$ S $ contains only uppercase Latin letters.\n\n**Objective**  \nDetermine whether the substring \"ACM\" appears in $ S $.  \n- If \"ACM\" $ \\subseteq S $, output \"Fun!\".  \n- Otherwise, output \"boring...\".","simple_statement":"Print \"Fun!\" if the text contains \"ACM\", otherwise print \"boring...\".","has_page_source":false}