import math
def extgcd(a, b):
    # ax + by = gcd(a,b)
    # return gcd(a,b), x, y
    if a == 0:
        return b, 0, 1
    else:
        g, x, y = extgcd(b % a, a)
        return g, y - (b // a) * x, x

def chineseRem(b1, m1, b2, m2):
    # x ≡ b1 (mod m1) ∧ x ≡ b2 (mod m2) <=> x ≡ r (mod m)
    # となる(r. m)を返す
    # 解無しのとき(0, -1)
    d, p, q = extgcd(m1, m2)
    if (b2 - b1) % d != 0:
        return 0, -1
    m = m1 * (m2 // d)  # m = lcm(m1, m2)
    tmp = (b2-b1) // d * p % (m2 // d)
    r = (b1 + m1 * tmp) % m
    return r, m


a,b,c = map(int,input().split())
X = int(input())

for _ in range(3):
    g = math.gcd(a,b)
    if g == 1 or X%g == 0:
        print("Yes")
        exit()
    if c%g == X%g:
        print("Yes")
        exit()

    if X%math.gcd(g,c) == 0:
        print("Yes")
        exit()
    a,b,c = c,a,b

if X%a*X%b*X%c:
    print("No")
else:
    print("Yes")