#[allow(dead_code)] fn solve(read: &mut snio::Reader>) { let n = read.usize(); let a:Vec<_> = (0..n).map(|_| read.i64()).collect(); let b:Vec<_> = (0..n).map(|_| read.i64()).collect(); let mut sum = vec![0;n]; let mut ss = 0; for i in 0..n { sum[i] = a[i] + b[i]; ss += sum[i]; } let mut d = vec![0;1 + n]; for i in 0..n { d[i + 1] = d[i] + sum[i]; } //println!("{:?}",d); let mut c = vec![0;2 * n]; for i in 1..n + 1 { c[i] = c[i - 1] + d[i]; } //println!("{:?}",sum); //println!("{:?}",c); for i in 0..n - 1 { c[n + 1 + i] = c[n + i] + ss - (n as i64 + 1) * (a[i] + b[i]); ss -= a[i] + b[i]; } for i in 0..2 * n { if i < 2 * n - 1 { print!("{} ",c[i]); }else { println!("{}",c[i]); } } } //use proconio::input; fn main() { let t = std::io::stdin(); let mut read = snio::Reader::new(t.lock()); let n = 1; for _ in 0..n { solve(&mut read); } } #[allow(dead_code)] pub mod snio { pub struct Reader { reader: R, buf: std::collections::VecDeque, } impl Reader { pub fn new(reader: R) -> Self { Self { reader, buf: std::collections::VecDeque::new(), } } fn load(&mut self) { while self.buf.is_empty() { let mut s = String::new(); let length = self.reader.read_line(&mut s).unwrap(); if length == 0 { break; } self.buf.extend(s.split_whitespace().map(|s| s.to_owned())); } } pub fn string(&mut self) -> String { self.load(); self.buf.pop_front().unwrap_or_else(|| panic!("input ended")) } pub fn char(&mut self) -> char { let string = self.string(); let mut chars = string.chars(); let res = chars.next().unwrap(); assert!(chars.next().is_none(), "invalid input!"); res } pub fn chars(&mut self) -> Vec { self.read::().chars().collect() } pub fn read(&mut self) -> T where ::Err: ::std::fmt::Debug, { self.string().parse::().expect("Failed to parse the input.") } } macro_rules! definition_of_reader_of_numbers { ($($ty:tt,)*) => { impl Reader { $( #[inline] pub fn $ty (&mut self) -> $ty { self.read::<$ty>() } )* } } } definition_of_reader_of_numbers! { u8,u16,u32,u64,usize, i8,i16,i32,i64,isize, f32,f64, } } const INF:i64 = 1i64 << 60;