lib C fun strtoll(s : UInt8*, p : UInt8**, b : Int32) : Int64 end class String def to_i64 C.strtoll(self, nil, 10) end end struct Mint @@MOD = 998244353i64 def self.mod @@MOD end def self.zero Mint.new end @value : Int64 def initialize @value = 0i64 end def initialize(value) @value = value.to_i64 % @@MOD end def initialize(m : Mint) @value = m.value end protected def value=(value : Int64) @value = value end getter value : Int64 def + : self self end def - : self Mint.new(value != 0 ? @@MOD - @value : 0) end def +(m) Mint.new(@value + m.to_i64 % @@MOD) end def +(m : Mint) result = Mint.new result.value = @value + m.value result.value -= @@MOD if result.value > @@MOD result end def -(m) Mint.new(@value - m.to_i64 % @@MOD) end def -(m : Mint) result = Mint.new result.value = @value - m.value result.value += @@MOD if result.value < 0 result end def *(m) Mint.new(@value * m.to_i64) end def /(m) raise DivisionByZeroError.new if m == 0 a, b, u, v = m.to_i64, @@MOD, 1i64, 0i64 while b != 0 t = a // b a -= t * b a, b = b, a u -= t * v u, v = v, u end Mint.new(@value * u) end def //(m) self / m end def **(m : Int) t, res = self, Mint.new(1) while m > 0 res *= t if m.odd? t *= t m >>= 1 end res end def ==(m) @value == m.to_i64 end def !=(m) @value != m.to_i64 end def succ self + 1 end def pred self - 1 end def to_i64 : Int64 @value end delegate to_s, to: @value delegate inspect, to: @value end struct Int def to_mint : Mint Mint.new(self) end end class String def to_mint : Mint Mint.new(self) end end class Comb(T) def initialize(@Max = 400009) @factorial = Array(T).new(@Max, T.zero) @finv = Array(T).new(@Max, T.zero) @inv = Array(T).new(@Max, T.zero) @factorial[0] = @factorial[1] = T.new(1) @finv[0] = @finv[1] = T.new(1) @inv[1] = T.new(1) (2...@Max).each do |i| @factorial[i] = @factorial[i - 1] * i @inv[i] = -@inv[T.mod % i] * (T.mod / i) @finv[i] = @finv[i - 1] * @inv[i] end end def permutation(n, r) (n < r || n < 0 || r < 0) ? T.zero : @factorial[n] * @finv[n - r] end def combination(n, r) (n < r || n < 0 || r < 0) ? T.zero : @factorial[n] * @finv[r] * @finv[n - r] end def homogeneous_product(n, r) (n < 0 || r < 0) ? T.zero : r == T.zero ? T.new(1) : combination(n + r - 1, r) end def factorial(n) @factorial[n] end end c = Comb(Mint).new n = read_line.to_i puts (0..n).step(2).sum { |x| 2.to_mint**(n - 2*x).abs * c.combination(n, x) * 2 }