import sys
input = sys.stdin.readline

N=int(input())
A=list(map(int,input().split()))
A=[abs(a) for a in A]

from collections import Counter
C=Counter(A)

x=0
for c in C:
    if C[c]>1:
        x=c
        break

if x!=0:
    flag=0

    ANS=[]
    for a in A:
        if a!=x or flag==2:
            ANS.append(a)
        else:
            if flag==0:
                ANS.append(x)
                flag+=1
            elif flag==1:
                ANS.append(-x)
                flag+=1
                
    print("Yes")
    print(*ANS)
    sys.exit()

import heapq
B=[(-A[i],i) for i in range(N)]
S=set(A)
ANS=[0]*N
heapq.heapify(B)
while len(B)>=2:
    x,ind1=heapq.heappop(B)
    y,ind2=heapq.heappop(B)

    x=-x
    y=-y

    ANS[ind1]=x
    ANS[ind2]=-y

    S.remove(x)
    S.remove(y)

    if C[x-y] in S:
        fin=x-y

        for i in range(N):
            if A[i]==fin:
                ANS[i]=-fin

            print("Yes")
            print(*ANS)
            sys.exit()

    S.add(x-y)


M=min(12,N)
from itertools import product
ITER=product([-1,0,1],repeat=M)
SET=set(A[M:])

for ite in ITER:
    if max(ite)==min(ite)==0:
        continue
    S=0
    for i in range(M):
        S+=A[i]*ite[i]

    if S==0:
        ANS=[]
        for i in range(M):
            ANS.append(ite[i]*A[i])
        ANS+=[0]*abs(N-M)
        print("Yes")
        print(*ANS)
        break
    
    if S in SET:
        ANS=[]
        for i in range(M):
            ANS.append(ite[i]*A[i])
        ANS+=[0]*abs(N-M)

        for i in range(N):
            if A[i]==S:
                ANS[i]=-S
                break
        print("Yes")
        print(*ANS)
        break
                     
else:
    print("No")