{"raw_statement":[{"iden":"problem statement","content":"There are $N$ sheets of paper, numbered from $1$ to $N$.  \nEach sheet can be painted in one of three colors: red, blue, or yellow.  \nThe coloring must satisfy the following conditions:\n\n*   Each sheet must be painted in exactly one color.\n*   The number of sheets painted blue must be even.\n*   The number of sheets painted yellow must be odd.\n\nFind the number of valid colorings that satisfy the conditions, and output the result modulo $998244353$.\nTwo colorings are considered different if there exists at least one sheet that is painted in different colors."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 10^9$\n*   $N$ is an integer"},{"iden":"input","content":"The input is given from standard input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"3"},{"iden":"sample output 1","content":"7\n\nThere are $7$ valid colorings.  \nHere, $(c_1, c_2, c_3)$ means that sheet $1$ is painted in color $c_1$, sheet $2$ in $c_2$, and sheet $3$ in $c_3$.\n\n*   (red, red, yellow)\n*   (red, yellow, red)\n*   (yellow, red, red)\n*   (blue, blue, yellow)\n*   (blue, yellow, blue)\n*   (yellow, blue, blue)\n*   (yellow, yellow, yellow)"},{"iden":"sample input 2","content":"1000000000"},{"iden":"sample output 2","content":"224965629"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}