import java.io.PrintWriter import java.util.* import kotlin.math.* fun PrintWriter.solve() { val n = nextLong() val a = Array(2) { LongArray(2) { 1L } } a[1][1] = 0 val mat = Matrix(a) var ans = mat.pow(n).mat[0][0] - 1 if (ans < 0) ans += MOD println(ans) } // region Matrix const val MOD = 998244353L // const val MOD = 1000000007L class Matrix(val mat: Array) { private val n = mat.size operator fun plus(other: Matrix): Matrix { val b = mat.copyOf() for (i in 0 until n) { for (j in 0 until n) { b[i][j] += other.mat[i][j] b[i][j] %= MOD } } return Matrix(b) } operator fun minus(other: Matrix): Matrix { val b = mat.copyOf() for (i in 0 until n) { for (j in 0 until n) { b[i][j] -= other.mat[i][j] b[i][j] %= MOD b[i][j] += MOD b[i][j] %= MOD } } return Matrix(b) } operator fun times(other: Matrix): Matrix { val b = zero(n).mat for (k in 0 until n) { for (i in 0 until n) { for (j in 0 until n) { b[i][j] += mat[i][k] * other.mat[k][j] b[i][j] %= MOD } } } return Matrix(b) } fun pow(exp: Long): Matrix { if (exp == 0L) return e(n) var a = pow(exp shr 1) a *= a if (exp and 1L == 0L) return a return this * a } override fun toString(): String { return mat.joinToString("\n") { "[${it.joinToString()}]" } } } fun zero(n: Int): Matrix { return Matrix(Array(n) { LongArray(n) { 0 } }) } fun e(n: Int): Matrix { return Matrix(Array(n) { i -> LongArray(n) { j -> if (i == j) 1 else 0 } }) } // endregion fun main() { Thread(null, { val writer = PrintWriter(System.out, false) writer.solve() writer.flush() }, "solve", abs(1L.shl(26))) .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } } .apply { start() }.join() } // region Scanner private var st = StringTokenizer("") private val br = System.`in`.bufferedReader() fun next(): String { while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine()) return st.nextToken() } fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextLine() = br.readLine() fun nextDouble() = next().toDouble() // endregion