#mancala combo
#segment tree

def main():
    N = int(input())
    a = list(map(int, input().split()))
    a.insert(0, 0)
    mindex = N + 1
    for i in range(1, N+1):
        if a[i] == i:
            mindex = i
    if mindex > N:
        print("No")
        return
    else:
        if any(a[j] > 0 for j in range(mindex+1, N+1)):
            print("No")
            return
        
        else:
            flag = True
            flowsum = 1
            for j in range(mindex-1, 0, -1):
                if  (flowsum+a[j]) % (j) != 0:
                    flag = False
                    break
                else:
                    flowsum = flowsum + (flowsum+a[j])//j
                    continue
            if flag:
                print("Yes")
            else:
                print("No")
            return


if __name__ == "__main__":
    main()