INIT
#include <bits/stdc++.h>
using i128 = __int128;
using namespace std;
#ifdef LOCAL
#define deb(x) cerr<<"L"<<__LINE__<<": "<<#x<<" = "<<(x)<<endl
#else
#define deb(x)
#endif
#define endl "\n"
#define alls(x) (x).begin(),(x).end()
void solve() {
int n;
cin >> n;
vector<int>a(n + 1);
deb(n);
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
deb(a[i]);
int ans = accumulate(alls(a), 0);
cerr << ans << endl;
deb(ans);
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
double sttime = clock();
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int t = 1;
while (t--)
solve();
#ifdef LOCAL
double edtime = clock();
cerr << "time: " << (double)(edtime - sttime) / CLOCKS_PER_SEC * 1000 << endl;
#endif
return 0;
}
TEST
#include <bits/stdc++.h>
using i128 = __int128;
using namespace std;
#ifdef LOCAL
#define deb(x) (void)(cerr<<"L"<<__LINE__)<<": "<<#x<<" = "<<(x)<<endl)
#else
#define deb(x)
#endif
#define endl "\n"
void solve() {
array<int, 3>c{1, 2, 3};
for (auto i : c)
cout << i << " ";
i128 tmp = 0;
tmp++;
cout << "tmp" << endl;
map<int, int>mp;
mp[1] = 2;
mp[3] = 4;
auto dfs = [&](auto self, int u) {
if (u > 10)
return ;
cout << "dfs" << " " << u << endl;
self(self, u + 1);
};
dfs(dfs, 0);
for (auto [x, y] : mp)
cout << x << " " << y << endl;
vector in(2, vector<int>(2, 1));
for (auto x : in) {
for (auto y : x) {
cout << y << " ";
}
cout << endl;
}
vector<pair<int, int>>p(3);
p[1] = {1, 2};
p[2] = {3, 4};
for (auto [x, y] : p)
cout << x << " " << y << endl;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
double sttime = clock();
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
double edtime = clock();
cerr << "time: " << (double)(edtime - sttime) / CLOCKS_PER_SEC * 1000 << endl;
#endif
int t = 1;
while (t--)
solve();
return 0;
}