#include <iostream>
#include <cmath>
#include <stdio.h>
#include <array>
#include <vector>
#include <list>
#include <algorithm>
#include <utility>
#include <string>
#include <sstream>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#define pp pair<int,int>
#define pll pair<ll, ll>
#define ll long long
using namespace std;
ll prefix[300001];
int main() {
//freopen(".in", "r", stdin);
//freopen(".out", "w", stdout);
ll n;
cin >> n;
ll maxi = -10000000000;
for (int i = 1; i < n; i++) {
ll a;
cin >> a;
prefix[i] = prefix[i-1]+a;
maxi = max(prefix[i], maxi);
}
int index1 = 0;
for (int i = 1; i < n; i++) {
if (maxi == prefix[i]) {
index1 = i;
break;
}
}
int amount = n-prefix[index1];
cout << amount << " ";
for (int i = 1; i < n; i++) {
if (i == n-1) {
cout << amount+prefix[i] << endl;
} else {
cout << amount+prefix[i] << " ";
}
}
}
