{"raw_statement":[{"iden":"statement","content":"Congratulations! You have passed the preliminary screening of the Academy of Covert Missions and are now on your final test.\n\nYou have been tasked to keep track of some #cf_span(class=[tex-font-style-underline], body=[bops]) roaming around the Town Hidden in the Leaves. These #cf_span(class=[tex-font-style-underline], body=[bops]) are creatures that move very swiftly and are hard to spot, but you and your team have been successful in placing Toogly Tags around their necks. These tags allow you to know what each creature is doing, and even know where it is. Unfortunately, Nagaraiya, your examiner, tells you that you ended up putting the Toogly Tags on other creatures as well that are not #cf_span(class=[tex-font-style-underline], body=[bops]), and now you have to sort them out! That's nuts!\n\nThankfully those Toogly Tags that you attached not only know what the creatures are doing, but can also record the sounds that they are making as well. You remember the age-old Covert Agent Way: \"If it beeps like a #cf_span(class=[tex-font-style-underline], body=[bop]) and boops like a #cf_span(class=[tex-font-style-underline], body=[bop]), then it must be a #cf_span(class=[tex-font-style-underline], body=[bop]).\"\n\nWith this wisdom that is almost as old as Wan Puhn Seh, you now have a way to sort the #cf_span(class=[tex-font-style-underline], body=[bops]) from the other creatures! #cf_span(class=[tex-font-style-underline], body=[Bops]) can only make the sounds \"BEEP\" or \"BOOP\". Other creatures make their own sounds that are never \"BEEP\" or \"BOOP\".\n\nYou now go back to Nagaraiya and tell him which ones are #cf_span(class=[tex-font-style-underline], body=[bops]) and which ones are not!\n\nOn the first line is an integer $C$, the number of creatures that you have attached Toogly Tags on. Then follow $C$ blocks describing the sounds that each creature makes.\n\nEach block starts with a line containing an integer $N_i$, the number of sounds that the $i^(t h)$ creature made. Then follow $N_i$ strings, each on its own line, indicating a sound that the $i^(t h)$ creature made.\n\n*Constraints*\n\n$1 <= C <= 350$\n\n$1 <= N_i <= 350$\n\nEach sound consists of uppercase letters only and has length between $1$ and $10$ (inclusive).\n\nIf the creature is a bop, print \"_IT'S A BOP!_\" (without the quotes). Otherwise, output \"_IT'S NOT A BOP!_\" (without the quotes).\n\n"},{"iden":"input","content":"On the first line is an integer $C$, the number of creatures that you have attached Toogly Tags on. Then follow $C$ blocks describing the sounds that each creature makes.Each block starts with a line containing an integer $N_i$, the number of sounds that the $i^(t h)$ creature made. Then follow $N_i$ strings, each on its own line, indicating a sound that the $i^(t h)$ creature made.*Constraints*$1 <= C <= 350$$1 <= N_i <= 350$Each sound consists of uppercase letters only and has length between $1$ and $10$ (inclusive)."},{"iden":"output","content":"If the creature is a bop, print \"_IT'S A BOP!_\" (without the quotes). Otherwise, output \"_IT'S NOT A BOP!_\" (without the quotes)."},{"iden":"examples","content":"Input3\n3\nBEEP\nBOOP\nBOOP\n4\nBOOP\nBEEP\nBEEP\nBOOP\n4\nBIP\nBUP\nQUACK\nBOO\nOutputIT'S A BOP!\nIT'S A BOP!\nIT'S NOT A BOP!\nInput3\n7\nBEEP\nBOOP\nBEEP\nBOOP\nBOOP\nBOOP\nBEEP\n5\nQUACK\nKWAK\nQUACK\nKWAKK\nQUAKK\n3\nARF\nWOOF\nARFF\nOutputIT'S A BOP!\nIT'S NOT A BOP!\nIT'S NOT A BOP!\n"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ \\ell, w \\in \\mathbb{Z}^+ $ with $ \\ell > w $.  \nThe grid has dimensions $ \\ell \\times w $, with cells indexed from $ (1,1) $ (top-left) to $ (\\ell, w) $ (bottom-right).  \n\n**Constraints**  \nA cell $ (i, j) $ is **blocked** if $ j < i - (\\ell - w + 1) + 1 $ or $ j > i $.  \nEquivalently, a cell $ (i, j) $ is **accessible** if and only if:  \n$$\ni - (\\ell - w) \\leq j \\leq i\n$$  \nand $ 1 \\leq i \\leq \\ell $, $ 1 \\leq j \\leq w $.  \n\n**Objective**  \nCount the number of monotonic paths from $ (1,1) $ to $ (\\ell, w) $, using only right ($ \\rightarrow $) and down ($ \\downarrow $) moves, staying entirely within the accessible region.  \n\nOutput the result modulo $ 104857601 $.","simple_statement":"Maggie and Dana start at the top-left corner of an ℓ × w grid and must reach the bottom-right corner, moving only right or down.  \n\nThe grid has a special \"cascading path\": in row i (0-indexed), only the cells from column i to column i + (ℓ - w) are open — all other cells are blocked.  \n\nCount the number of valid paths from (0,0) to (ℓ-1, w-1) under this constraint.  \n\nOutput the answer modulo 104857601.","has_page_source":false}