Problem: While discussing a proper problem A for a Codeforces Round, Kostya created a cyclic array of positive integers a_1, a_2, …, a_n. Since the talk was long and not promising, Kostya created a new cyclic array b_1, b_2, …, b_{n} so that b_i = (a_i mod a_{i + 1}), where we take a_{n+1} = a_1. Here mod is the [modulo operation](https://en.wikipedia.org/wiki/Modulo_operation). When the talk became interesting, Kostya completely forgot how array a had looked like. Suddenly, he thought that restoring array a from array b would be an interesting problem (unfortunately, not A).

Input

The first line contains a single integer n (2 ≤ n ≤ 140582) — the length of the array a.

The second line contains n integers b_1, b_2, …, b_{n} (0 ≤ b_i ≤ 187126).

Output

If it is possible to restore some array a of length n so that b_i = a_i mod a_{(i mod n) + 1} holds for all i = 1, 2, …, n, print «YES» in the first line and the integers a_1, a_2, …, a_n in the second line. All a_i should satisfy 1 ≤ a_i ≤ 10^{18}. We can show that if an answer exists, then an answer with such constraint exists as well.

It it impossible to restore any valid a, print «NO» in one line.

You can print each letter in any case (upper or lower).

Examples

Input

4
1 3 1 0


Output

YES
1 3 5 2


Input

2
4 4


Output

NO

Note

In the first example:

  * 1 mod 3 = 1 
  * 3 mod 5 = 3 
  * 5 mod 2 = 1 
  * 2 mod 1 = 0 

Solution (in PYTHON3):

Solution:
n = int(input())
b = list(map(int, input().split()))

pos = [i for i in range(n) if b[i] > b[i - 1]]
if not pos:
    if b[0] == 0:
        a = [1] * n
        print('YES')
        print(*a)
    else:
        print('NO')
else:
    x = pos[0]
    a = [0] * n
    a[x] = b[x]
    cur = b[x]
    i = x - 1
    while i % n != x % n:
        i %= n
        p = b[i - 1]
        if p < b[i]:
            a[i] = b[i]
        else:
            p -= b[i]
            zz = cur * (p // cur)
            zz += cur
            a[i] = zz + b[i]
        cur = a[i]
        i -= 1
    print('YES')
    print(*a)