use std::collections::*;

struct Scanner<R: std::io::BufRead> {
    stack: VecDeque<Vec<String>>,
    input: R,
}
impl<R: std::io::BufRead> Scanner<R> {
    fn new(input: R) -> Self {
        Self {
            stack: VecDeque::<Vec<String>>::new(),
            input: input,
        }
    }
    fn take(&mut self) -> Option<String> {
        while let Some(s) = self.stack.front_mut() {
            if let Some(t) = s.pop() {
                return Some(t);
            }
            self.stack.pop_front();
        }
        self.enqueue_line();
        if !self.stack.is_empty() {
            return self.take();
        }
        None
    }
    fn enqueue(&mut self, t: String) {
        self.stack.push_back(
            t.trim()
                .split_ascii_whitespace()
                .map(|s| s.to_owned())
                .rev()
                .collect(),
        )
    }
    #[allow(unused)]
    fn enqueue_line(&mut self) {
        let mut t = String::new();
        self.input.read_line(&mut t).ok();
        self.enqueue(t);
    }
    #[allow(unused)]
    fn enqueue_to_end(&mut self) {
        let mut t = String::new();
        self.input.read_to_string(&mut t).ok();
        self.enqueue(t);
    }
}

#[allow(unused)]
macro_rules! scan {
    ($io:expr => $t:ty) => {
        $io.take().unwrap().parse::<$t>().unwrap()
    };
    ($io:expr => $t:tt * $n:expr) => ((0..$n).map(|_| scan!($io => $t)).collect::<Vec<_>>());
    ($io:expr => $($t:tt),*) => (($(scan!($io => $t)),*));
}

macro_rules! scan {
    ($io:expr => $t:ty) => {
        $io.take().unwrap().parse::<$t>().unwrap()
    };
    ($io:expr => $t:tt * $n:expr) => ((0..$n).map(|_| scan!($io => $t)).collect::<Vec<_>>());
    ($io:expr => $($t:tt),*) => (($(scan!($io => $t)),*));
}

fn main() {
    solve(Scanner::<std::io::StdinLock>::new(std::io::stdin().lock()))
}

fn solve<R: std::io::BufRead>(mut cin: Scanner<R>) {
    let n = scan!(cin => i32);
    let aa = scan!(cin => i64 * n);
    let total = aa.iter().sum::<i64>();
    println!("{}", total);
}