#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

long long q[200001];
int chk[200001];
int main() {
    int n;
    cin >> n;
    long long m = 0;
    q[0] = 0;
    for (int i = 1; i < n; i++) {
        int tmp;
        cin >> tmp;
        q[i] = q[i - 1] + tmp;
        if (q[i] < m) {
            m = q[i];
        }
    }
    long long x = 1 - m;
    vector<int> v;
    int flag = 0;
    for (int i = 0; i < n; i++) {
        int num = x + q[i];
        if (chk[num] == 0 && num>=0 && num<=n) {
            chk[num] = 1;
            v.push_back(num);
        }
        else {
            flag = 1;
            break;
        }
    }
    if (flag) {
        cout << -1;
    }
    else {
        for (auto x : v) {
            cout << x << ' ';
        }
    }
    return 0;
}