#include <iostream>
#include <climits>
#include <numeric>
#include <cassert>
#include <algorithm>
#include <queue>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <array>
#include <memory>
#define IN(a,b) (a.find(b) != a.end())
#define p(a,b) make_pair(a,b)
#define readVec(a) for (int __i = 0; __i<(int)a.size();__i++){cin>>a[__i];}
// jimjam
template<typename T>
void pMin(T &a, T b) {if (b<a){a=b;}}
template<typename T>
void pMax(T &a, T b) {if (b>a){a=b;}}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c);
template<typename A, typename B>
std::ostream& operator<<(std::ostream& os, const std::pair<A,B>& c) {std::cout << "(" << c.first << ", " << c.second << ")";return os;}
template<typename T>
std::ostream& operator<<(std::ostream& os, const std::vector<T>& c) {
if (c.size() == 0) {os << "{}"; return os;}
os << "{" << c[0];
for (int i = 1; i < (int)c.size(); i++) {os <<", "<<c[i];}
os << "}";
return os;
}
using namespace std;
const int inf = 2e9;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
vector<int> a(n-1);
readVec(a);
vector<int> pref(n);
for(int i = 1; i < n; i++) {
pref[i] = pref[i-1] + a[i-1];
}
int mi = inf;
int miInd = -1;
for (int i = 0; i < n; i++) {
if (pref[i]<mi) {
mi=pref[i];
miInd=i;
}
}
assert(miInd!=-1);
vector<int> ans(n);
ans[miInd]=1;
for (int i = miInd+1; i < n; i++) {
ans[i] = ans[i-1] + a[i-1];
}
for (int i = miInd-1; i >= 0; i--) {
ans[i] = ans[i+1] - a[i];
}
int ma = *max_element(ans.begin(),ans.end());
mi = *min_element(ans.begin(),ans.end());
if (ma-mi+1!=n) {
cout << -1 << endl;
return 0;
}
int shift = 1-mi;
for (int i : ans) cout << i+shift << " ";
cout << endl;
return 0;
}
