#  中華風（easy）
import math


def xgcd(a, b):
    x0, y0, x1, y1 = 1, 0, 0, 1
    while b != 0:
        q, a, b = a // b, b, a % b
        x0, x1 = x1, x0 - q * x1
        y0, y1 = y1, y0 - q * y1
    return a, x0, y0

# すなわちax==1(mod m)なる自然数xを返してくれる関数 動作時間:logM


def modinv(a, m):
    g, x, y = xgcd(a, m)
    if g != 1:
        return False
    else:
        return x % m


def modular_numbers(pair1, pair2):
    x1, y1 = pair1
    x2, y2 = pair2
    g = math.gcd(y1, y2)
    if (x2-x1) % g != 0:
        return (float("inf"), float("inf"))
    else:
        K = (x2-x1)//g
        y1, y2 = y1//g, y2//g
        t = -K*modinv(y2, y1)
        m = x2+t*g*y2
        return (m % (g*y1*y2), g*y1*y2)


def main():
    que = [tuple(map(int, input().split())) for i in range(3)]
    base = modular_numbers(que[0], que[1])
    if base[0] == float("inf"):
        print(-1)
        return
    else:
        ans = modular_numbers(base, que[2])
        if ans[0] == float("inf"):
            print(-1)
            return
        else:
            if ans[0] > 0:
                print(ans[0])
            else:
                print(ans[1])
            return


if __name__ == "__main__":
    main()