#include <bits/stdc++.h>   using namespace std;   bool y[200005];   long long n, m, k, j, i, p[2000005], q[2000005], haj[2000005], s, sum;   int main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     cin >> n;     p[1] = 0;     sum = n * (n + 1) / 2;     for (i = 1; i < n; i++) {       haj[i] = i;       cin >> q[i];       p[i + 1] = p[i] + q[i];       s += p[i + 1];     }     haj[n] = n;     sum -= s;     if (sum % n != 0) {       cout << -1 << endl;       return 0;     } else {       for (i = 1; i <= n; i++) p[i] += sum / n;       for (i = 1; i <= n; i++) {         if (p[i] < 0 || p[i] > n) {           cout << -1 << endl;           return 0;         } else if (y[p[i]]) {           cout << -1 << endl;           return 0;         } else {           y[p[i]] = true;         }       }       for (i = 1; i <= n; ++i) {         cout << p[i] << endl;       }       return 0;     }     return 0;   }   