#include<bits/stdc++.h>

using namespace std;

#define ull unsigned long long int
#define ll long long int
#define rep(i,n) for(int i=0;i<(n);i++)
#define repo(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrepo(i,n) for(int i=(n);i>=1;i--)
#define rep2(i,s,n) for(int i=(s);i<(n);i++)
#define repr2(i,s,n) for(int i=(n)-1;i>=(s);i--)
#define vrep(v,V) for(auto &v:V)
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) (x).begin(),(x).end()
#define allc(x) (x).cbegin(),(x).cend()
#define allr(x) (x).rbegin(),(x).rend()
#define vec(T) vector<T>
#define vvec(T) vec(vec(T))
#define vvvec(T) vvec(vec(T))
#define vvvvec(T) vvvec(vec(T))
#define pvec(T,U) vector<pair<T,U>>
#define fixd(N) cout<<fixed<<setprecision(16)<<(N)
#define YESNO(B) if(B){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define YesNo(B) if(B){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define yesno(B) if(B){cout<<"yes"<<endl;}else{cout<<"no"<<endl;}
#define pqueg(T) priority_queue<T,vec(T),greater<T>>
#define pque(T) priority_queue<T>

template <typename T>
bool chmax(T& a,const T& b){if(a<b){a=b;return true;}else{return false;}}
template <typename T>
bool chmin(T& a,const T& b){if(a>b){a=b;return true;}else{return false;}}
template <typename T>
bool chmax2(T& a,T& b,T& c){if(a<=c){b=a;a=c;return true;}else if(b<c){b=c;return true;}else{return false;}}
template <typename T>
bool chmin2(T& a,T& b,T& c){if(a>=c){b=a;a=c;return true;}else if(b>c){b=c;return true;}else{return false;}}

//using mint = modint998244353;
//using mint = modint1000000007;
//#define pa pair<int,mint>
//#define tu tuple<int,int,int>

int main(){
	int N;
	ll A,S=0LL;
	cin>>N;
	rep(_,N){
		cin>>A;
		S+=A;
	}
	cout<<S<<endl;
}