N = int(input())
Y = list(map(int, input().split()))

def min_min(i = 0, n = N, *list_Y):
    
    count =0
    if i == n-1:
        if list_Y[i] <= list_Y[i+1]:
            return list_Y
        else:
            while(list_Y[i] > list_Y[i+1]):
                list_Y[i+1] += 1
                count += 1
            return list_Y

    if list_Y[i] <= list_Y[i+1]:
        i += 1
        min_min(i, n, *list_Y)
    else:
        if list_Y[i+1] <= list_Y[i+2]:
            while(list_Y[i]>list_Y[i+1]):
                list_Y[i] -= 1
                count += 1
            i += 1
        else:
            while(list_Y[i]>list_Y[i+1]):
                list_Y[i+1] += 1
                count += 1
            i += 1
        min_min(i, n, *list_Y)

min_min(0, N, Y)