fn main() { let stdin = std::io::stdin(); let mut rd = ProconReader::new(stdin.lock()); let n: usize = rd.get(); let a: Vec = rd.get_vec(n); type Mint = ModInt998244353; let a: Vec = a.iter().map(|&x| Mint::new(x)).collect(); if n == 1 { println!("{}", a[0].val()); return; } let ans = a .iter() .zip(0..n) .map(|(&x, i)| Mint::new(i as i32 + 2) * x) .fold(Mint::new(0), |acc, x| acc + x); let ans = ans * Mint::new(2).pow((n - 2) as u64); println!("{}", ans.val()); } use std::fmt::Debug; use std::marker::PhantomData; use std::ops::{Add, Div, Mul, Sub}; pub trait Modulo: Copy + Clone + Debug { fn p() -> i64; } #[derive(Copy, Clone, Debug)] pub struct ModInt(i64, PhantomData); impl ModInt { pub fn new(x: T) -> Self where T: Into, { let x = x.into(); if 0 <= x && x < M::p() { Self::new_raw(x) } else { Self::new_raw(x.rem_euclid(M::p())) } } pub fn new_raw(x: i64) -> Self { Self(x, PhantomData) } pub fn val(self) -> i64 { self.0 } pub fn mo() -> i64 { M::p() } pub fn pow(self, exp: u64) -> Self { let mut res = 1; let mut base = self.0; let mut exp = exp; let mo = Self::mo(); while exp > 0 { if exp & 1 == 1 { res *= base; res %= mo; } base *= base; base %= mo; exp >>= 1; } Self::new_raw(res) } pub fn inv(self) -> Self { assert_ne!(self.0, 0, "Don't divide by zero!"); self.pow(Self::mo() as u64 - 2) } pub fn new_frac(numer: i64, denom: i64) -> Self { Self::new(numer) / Self::new(denom) } } #[allow(clippy::suspicious_arithmetic_impl)] impl Add for ModInt { type Output = ModInt; fn add(self, rhs: ModInt) -> Self::Output { let x = self.0 + rhs.0; debug_assert!(x >= 0); if x < Self::mo() { Self::new_raw(x) } else { Self::new_raw(x - Self::mo()) } } } #[allow(clippy::suspicious_arithmetic_impl)] impl Sub for ModInt { type Output = ModInt; fn sub(self, rhs: ModInt) -> Self::Output { let x = self.0 - rhs.0; debug_assert!(x < Self::mo()); if x >= 0 { Self::new_raw(x) } else { Self::new_raw(x + Self::mo()) } } } impl Mul for ModInt { type Output = ModInt; fn mul(self, rhs: ModInt) -> Self::Output { Self::new(self.0 * rhs.0) } } #[allow(clippy::suspicious_arithmetic_impl)] impl Div for ModInt { type Output = ModInt; fn div(self, rhs: ModInt) -> Self::Output { self * rhs.inv() } } #[macro_export] macro_rules! define_mod_int_p { ($mod: ident, $mod_int: ident, $p: expr) => { #[derive(Clone, Copy, Debug)] pub struct $mod; impl Modulo for $mod { fn p() -> i64 { $p } } pub type $mod_int = ModInt<$mod>; }; } define_mod_int_p!(Mod1000000007, ModInt1000000007, 1_000_000_000 + 7); define_mod_int_p!(Mod998244353, ModInt998244353, 998_244_353); pub struct ProconReader { r: R, line: String, i: usize, } impl ProconReader { pub fn new(reader: R) -> Self { Self { r: reader, line: String::new(), i: 0, } } pub fn get(&mut self) -> T where T: std::str::FromStr, ::Err: std::fmt::Debug, { self.skip_blanks(); assert!(self.i < self.line.len()); assert_ne!(&self.line[self.i..=self.i], " "); let line = &self.line[self.i..]; let end = line.find(' ').unwrap_or_else(|| line.len()); let s = &line[..end]; self.i += end; s.parse() .unwrap_or_else(|_| panic!("parse error `{}`", self.line)) } fn skip_blanks(&mut self) { loop { let start = self.line[self.i..].find(|ch| ch != ' '); match start { Some(j) => { self.i += j; break; } None => { self.line.clear(); self.i = 0; let num_bytes = self.r.read_line(&mut self.line).unwrap(); assert!(num_bytes > 0, "reached EOF :("); self.line = self.line.trim_end_matches(&['\r', '\n'][..]).to_string(); } } } } pub fn get_vec(&mut self, n: usize) -> Vec where T: std::str::FromStr, ::Err: std::fmt::Debug, { (0..n).map(|_| self.get()).collect() } }