#include <bits/stdc++.h>
const int mod = 1e9 + 7, MAX = 2e5 + 5;
const long long inf = 1e18;
const double eps = 1e-9;
using namespace std;
struct abc {
  char a;
  int i;
};
bool comp(abc a, abc b) { return a.a > b.a; }
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<long long> q(n - 1);
  for (int i = 0; i < n - 1; ++i) cin >> q[i];
  vector<long long> ans(n);
  ans[0] = 0;
  for (int i = 1; i < n; i++) {
    ans[i] = q[i - 1] + ans[i - 1];
  }
  long long mini = 1e18;
  for (int i = 0; i < n; ++i) mini = min(mini, (long long)ans[i]);
  mini--;
  for (int i = 0; i < n; ++i) ans[i] -= mini;
  set<int> a;
  for (int i = 0; i < n; ++i) {
    if (a.count(ans[i]) || ans[i] > n) {
      cout << -1;
      return 0;
    }
    a.insert(ans[i]);
  }
  for (int i = 0; i < n; ++i) cout << ans[i] << ' ';
}
