10000000 0

#include<bits/stdc++.h>
#define file(F) freopen(#F".in","r",stdin),freopen(#F".out","w",stdout)
#define lowbit(x) ((x)&-(x))
#define ALL(x) x.begin(),x.end()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define popcount(x) (__builtin_popcount((x)))
using namespace std;
using ll=long long;
using uint=uint32_t;
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
namespace FastIO {
#ifdef ONLINE_JUDGE
#include<sys/mman.h>
static const char *_read_ptr = (const char*)mmap(nullptr,0x7fffffff,1,2,0,0);
static const char *_write_ptr = (const char*)mmap(nullptr,0x7fffffff,2,2,0,0);
#define __getc() (*_read_ptr++)
#define __putc(c) (*_write_ptr++=(c))
#else
#define __getc() (getchar())
#define __putc(c) (putchar(c))
#endif
inline void read(int32_t &x) {
   static char ch; bool sg=false; x=0;
   while(!isdigit(ch=__getc())) sg^=ch=='-';
   for(;isdigit(ch);ch=__getc()) x=(x<<3)+(x<<1)+(ch&0xf);
   sg&&(x=~x+1);
}
inline void read(uint32_t &x) {
   static char ch; x=0;
   while(!isdigit(ch=__getc())) ;
   for(;isdigit(ch);ch=__getc()) x=(x<<3)+(x<<1)+(ch&0xf);
}
inline void write(int64_t x) {
   if(x<0) __putc('-'),x=-x;
   if(x>9) write(x/10),x%=10;
   __putc(x+'0');
}
}
using FastIO::read;
using FastIO::write;
signed main() {
#ifndef ONLINE_JUDGE
#endif
   cin.tie(nullptr)->sync_with_stdio(false);
   Solve();
}
void Solve() {
   int n; read(n);
   ll sum=0;
   for(int i=1;i<=n;i++) {
      int x; read(x);
      sum+=x;
   }
   write(sum);
}