import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline()[:-1]
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def gcd(a,b):
    while b:a,b=b,a%b
    return a

def lcm(a,b):
    return a*b//gcd(a,b)

def extgcd(a,b,c):
    if b==0:return c//a,0,abs(a)
    x,y,g=extgcd(b,a%b,c)
    return y,x-y*(a//b),g

def main():
    x1,y1=MI()
    x2,y2=MI()
    x3,y3=MI()
    n,m,g=extgcd(y1,y2,x1-x2)
    if (x1-x2)%g>0:
        print(-1)
        exit()
    x4=y1*n+x1
    y4=lcm(y1,y2)
    n,m,g=extgcd(y4,y3,x4-x3)
    if (x4-x3)%g>0:
        print(-1)
        exit()
    print((y4*n+x4)%lcm(y4,y3))

main()