def main():
    try:
        N = int(input().strip())
    except:
        print("No")
        return
    A = list(map(int, input().split()))
    if len(A) != N + 1:
        print("No")
        return

    # Total number of vertices
    n = sum(A)
    # Total degree sum
    S = sum(i * A[i] for i in range(N + 1))

    # Empty forest is allowed
    if n == 0:
        print("Yes")
        return
    # Condition 1: S is even
    if S % 2 != 0:
        print("No")
        return
    # Number of edges
    E = S // 2
    # Condition 2: edges <= vertices - 1 (only if n >= 1)
    if n >= 1 and E > n - 1:
        print("No")
        return
    # Condition 3: max degree <= n - 1 (only if n >= 1)
    if n >= 1:
        max_deg = max((i for i, cnt in enumerate(A) if cnt > 0), default=0)
        if max_deg > n - 1:
            print("No")
            return

    print("Yes")

if __name__ == '__main__':
    main()