#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char const *argv[])
{
int N; cin >> N;
vector<ll> v(N - 1, 0);
for (int i = 0; i < N - 1; i++)
cin >> v[i];
vector<vector<ll>> sol;
for (int i = 1; i <= N; i++) {
if (sol.size() > 1) {
break;
}
vector<ll> temp;
ll sum = i;
temp.push_back(sum);
bool flag = false;
for (int j = 0; j < N - 1; j++) {
sum += v[j];
if (sum <= 0 || sum > N) {
flag = true;
break;
} else {
temp.push_back(sum);
}
}
if (!flag)
sol.push_back(temp);
}
if (sol.size() == 1) {
for (auto el : sol[0])
cout << el << " ";
cout << endl;
} else {
cout << -1 << endl;
}
return 0;
}
