import sys
import math
#from collections import deque, defaultdict, Counter
#import heapq
#import bisect
#import itertools
#import functools

# 外部ライブラリ（AtCoder環境で利用可能）
#from sortedcontainers import SortedList, SortedSet, SortedDict
#from atcoder.dsu import DSU
#from atcoder.segtree import SegTree
#from atcoder.lazysegtree import LazySegTree
#from atcoder.fenwicktree import FenwickTree

# 入力高速化
#input = sys.stdin.readline
# 再帰回数上限

# よくあるmod
#MOD = 1000000007
MOD = 998244353

from collections import Counter

def solve():
    # 解答ここから
    A, B, C = map(int, input().split(' '))
    if (A + B + C) % 6 != 0:
        print("No")
        return
    A, B, C = max(A, B, C), A + B + C -max(A, B, C) - min(A, B, C) , min(A, B, C)

    d1 = A - B
    d2 = B - C
    if d1 == 1 and d2 == 1:
        print("Yes")
        return

    if d1 < d2:
        if C >= d2 and (B + C) >= 3 * (d2 - 1):
            print("Yes")
        else:
            print("No")
    else:
        if C >= d1 and (A + B) >= 3 * (d1 - 1):
            print("Yes")
        else:
            print("No")
if __name__ == '__main__':
    T = 1
    for _ in range(T):
        solve()