import bisect
import math
import sys
from itertools import accumulate
from math import isqrt, inf
from typing import List, Tuple

sys.setrecursionlimit(10 ** 6)

MOD = 998244353

int1 = lambda x: int(x) - 1
input = lambda: sys.stdin.readline().rstrip('\n')
ii = lambda: int(input())
vi = lambda: list(map(int, input().split()))
vi1 = lambda: list(map(int1, input().split()))


def dbg(*args, **kwargs):
    print(*(repr(arg) for arg in args), *(f'{k}: {repr(v)}' for k, v in kwargs.items()),
          sep='; ', file=sys.stderr, flush=True)


def main():
    a, b, c = vi()
    return 'Yes' if \
        a % 2 == 0 == (b * c) % 3 or b % 2 == 0 == (a * c) % 3 or c % 2 == 0 == (a * b) % 3 \
        or ((a * b * c) % 6 == 0 and a * b * c != 6) \
        else 'No'


def _start():
    if (ret := main()) is not None:
        print(*ret) if isinstance(ret, List) or isinstance(ret, Tuple) else print(ret)


if __name__ == '__main__':
    _start()