#include <bits/stdc++.h> using namespace std; // #define cerr cout #define int long long #define ll long long #define llu unsigned long long #define ui unsigned int #define ld long double #define ldu unsigned long double #define pb push_back #define TASK "" const int maxn = 3e5; int n, d[maxn + 5], a[maxn + 5]; void solve(int& tc){ // cerr << "Testcase " << tc << endl; cin >> n; for(int i = 1; i <= n - 1; ++i) cin >> d[i]; for(int i = 1; i <= n - 1; ++i){ d[i] += d[i - 1]; } int mi = *min_element(d, d + n), mx = *max_element(d, d + n); if(mx - mi + 1 != n || mx > n || mi < -n){ cout << -1 << '\n'; return; } int delta = 1 - mi; for(int i = 1; i <= n; ++i){ a[i] = d[i - 1] + delta; cout << a[i] << ' '; } cout << '\n'; } signed main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); // freopen(TASK".INP", "r", stdin); // freopen(TASK".OUT", "w", stdout); // freopen("debug.txt", "w", stdout); int Tests = 1; // cin >> Tests; // cin.ignore(); int cnt = 1; while (Tests--) { solve(cnt); ++cnt; } return 0; }