/* Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528) */ #include <bits/stdc++.h> using namespace std; #define int long long #define ull unsigned long long #define ld long double #define pii pair<int, int> #define fi first #define se second #define __builtin_popcount __builtin_popcountll #define all(x) (x).begin(), (x).end() #define BIT(x, i) (((x) >> (i)) & 1) #define MASK(x) ((1ll << (x))) #define debug(a, l, r) for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n'; const int MAXN = 3e5 + 5; int n, d[MAXN], mx = 0, mi = 0; void init() { cin >> n; for (int i = 1; i < n; ++i) cin >> d[i]; for (int i = 1; i < n; ++i) d[i] += d[i - 1]; } void solve() { mx = max(0ll, *max_element(d + 1, d + n)); mi = min(0ll, *min_element(d + 1, d + n)); int l = n - mx; if (mx - mi != n - 1) { cout << -1; return; } cout << l << ' '; for (int i = 1; i < n; ++i) cout << l + d[i] << ' '; } signed main() { #ifdef NCTHANH freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif ios_base::sync_with_stdio(0); cin.tie(nullptr); cout.tie(nullptr); init(); solve(); return 0; }