#include<bits/stdc++.h>

int main(){
    int N;std::cin>>N;
    std::vector<std::pair<long long,int>> A(N);
    long long sum=0;
    for(int i=0;i<N;++i){
        std::cin>>A[i].first;
        A[i].second=i;
        sum+=A[i].first;
    }
    std::sort(A.rbegin(),A.rend());
    for(int i=0;i<N-1;++i){
        if(sum-2*A[i].first>=A.back().first){
            sum -= 2*A[i].first;
            A[i].first = -A[i].first;
        }
        else if(sum-A[i].first>=A.back().first){
            sum -= A[i].first;
            A[i].first=0;
        }
    }
    for(int i=0;i<=2;++i) if(sum==i*A[i].first){
        using P = std::pair<long long,int>;
        std::sort(A.begin(),A.end(),[](P a,P b){return a.second<b.second;});
        for(auto s:A) std::cout<<s.first<<" \n"[s.second==N-1];
        return 0;
    }
    std::cout<<-1<<"\n";
}