{"raw_statement":[{"iden":"statement","content":"On one of the planets of Solar system, in Atmosphere University, many students are fans of bingo game.\n\nIt is well known that one month on this planet consists of $n^2$ days, so calendars, represented as square matrix $n$ by $n$ are extremely popular.\n\nWeather conditions are even more unusual. Due to the unique composition of the atmosphere, when interacting with sunlight, every day sky takes one of three colors: blue, green or red.\n\nTo play the bingo, you need to observe the sky for one month — after each day, its cell is painted with the color of the sky in that day, that is, blue, green or red.\n\nAt the end of the month, students examine the calendar. If at least one row or column contains only cells of one color, that month is called lucky.\n\nLet's call two colorings of calendar different, if at least one cell has different colors in them. It is easy to see that there are $3^{n \\cdot n}$ different colorings. How much of them are lucky? Since this number can be quite large, print it modulo $998244353$."},{"iden":"input","content":"The first and only line of input contains a single integer $n$ ($1 \\le n \\le 1000\\,000$) — the number of rows and columns in the calendar."},{"iden":"output","content":"Print one number — number of lucky colorings of the calendar modulo $998244353$"},{"iden":"examples","content":"Input\n\n1\n\nOutput\n\n3\n\nInput\n\n2\n\nOutput\n\n63\n\nInput\n\n3\n\nOutput\n\n9933"},{"iden":"note","content":"In the first sample any coloring is lucky, since the only column contains cells of only one color.\n\nIn the second sample, there are a lot of lucky colorings, in particular, the following colorings are lucky:\n\nWhile these colorings are not lucky:\n\n"}],"translated_statement":"[{\"iden\":\"statement\",\"content\":\"在太阳系的某颗行星上，Atmosphere 大学的许多学生都是宾果游戏的粉丝。\\n\\n众所周知，这颗行星上一个月由 $n^2$ 天组成，因此以 $n \\\\times n$ 方阵形式表示的日历极为流行。\\n\\n天气条件更加异常。由于大气的独特成分，当与阳光相互作用时，每天的天空会呈现三种颜色之一：蓝色、绿色或红色。\\n\\n要玩宾果游戏，你需要观察一整个月的天空——每天结束后，将日历中对应单元格涂上当天天空的颜色，即蓝色、绿色或红色。\\n\\n月末时，学生们会检查日历。如果至少有一行或一列中的所有单元格颜色相同，则这个月被称为“幸运月”。\\n\\n我们称两种日历着色不同，当且仅当至少有一个单元格的颜色不同。容易看出，总共有 $3^{n \\\\cdot n}$ 种不同的着色方式。其中有多少种是“幸运”的？由于这个数字可能很大，请对 $998244353$ 取模输出。\\n\\n输入的第一行也是唯一一行包含一个整数 $n$（$1 \\\\leq n \\\\leq 1000000$）——表示日历的行数和列数。\\n\\n请输出一个数——日历的“幸运”着色方案数，对 $998244353$ 取模。\\n\\n在第一个样例中，任何着色都是幸运的，因为唯一的列中所有单元格颜色相同。\\n\\n在第二个样例中，存在大量幸运着色，例如以下着色是幸运的：\\n\\n而以下着色不是幸运的：\\n\\n\"},{\"iden\":\"input\",\"content\":\"输入的第一行也是唯一一行包含一个整数 $n$（$1 \\\\leq n \\\\leq 1000000$）——表示日历的行数和列数。\"},{\"iden\":\"output\",\"content\":\"请输出一个数——日历的“幸运”着色方案数，对 $998244353$ 取模\"},{\"iden\":\"examples\",\"content\":\"输入1输出3输入2输出63输入3输出9933\"},{\"iden\":\"note\",\"content\":\"在第一个样例中，任何着色都是幸运的，因为唯一的列中所有单元格颜色相同。在第二个样例中，存在大量幸运着色，例如以下着色是幸运的： 而以下着色不是幸运的： \"}]}","sample_group":[],"show_order":[],"formal_statement":"**Definitions** \nLet $ n \\in \\mathbb{Z}^+ $ be the dimension of an $ n \\times n $ grid. \nEach cell is colored with one of three colors: blue, green, or red. \nA coloring is *lucky* if at least one row or one column is monochromatic (all cells in that row/column have the same color).\n\nLet $ \\mathcal{C} $ be the set of all possible colorings: $ |\\mathcal{C}| = 3^{n^2} $. \nLet $ R_i $ be the set of colorings where row $ i $ is monochromatic, for $ i \\in \\{1, \\dots, n\\} $. \nLet $ C_j $ be the set of colorings where column $ j $ is monochromatic, for $ j \\in \\{1, \\dots, n\\} $. \n\n**Constraints** \n$ 1 \\leq n \\leq 10^6 $\n\n**Objective** \nCompute the number of lucky colorings: \n$$\n\\left| \\bigcup_{i=1}^n R_i \\cup \\bigcup_{j=1}^n C_j \\right| \\mod 998244353\n$$","simple_statement":null,"has_page_source":false}