#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define deb(x) cerr << #x << " = " << x << "\n";
#define deb2(x, y) cerr << #x << " = " << x << ", " << #y << " = " << y << "\n";
#define deb3(x, y, z) cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " << z << "\n";
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f first
#define s second
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
using ordered_multiset = tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
ll binpow(ll a, ll b) {
//a = a % mod;
ll res = 1;
while ( b > 0) {
if (b&1) {
res = (a*res);//%mod;
}
a = (a*a);//%mod;
b >>= 1;
}
return res;
}
void solve(int tc) {
ll n, ans = 0;
cin >> n;
while (n--) {
ll a;
cin >> a;
ans += a;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int tc = 1;
//cin >> tc;
for (int i = 1; i <= tc; ++i) {
solve(i);
}
return 0;
}
