codeforces #406 A. The Monster

A monster is chasing after Rick and Morty on another planet. They're so frightened that sometimes they scream. More accurately, Rick screams at times b, b + a, b + 2a, b + 3a, ... and Morty screams at times d, d + c, d + 2c, d + 3c, ....

The Monster will catch them if at any point they scream at the same time, so it wants to know when it will catch them (the first time they scream at the same time) or that they will never scream at the same time.

Input

The first line of input contains two integers a and b (1 ≤ a, b ≤ 100).

The second line contains two integers c and d (1 ≤ c, d ≤ 100).

Output

Print the first time Rick and Morty will scream at the same time, or  - 1 if they will never scream at the same time.

Examples

input

20 2
9 19

output

82

input

2 1
16 12

output

-1

Note

In the first sample testcase, Rick's 5th scream and Morty's 8th time are at time 82.

In the second sample testcase, all Rick's screams will be at odd times and Morty's will be at even times, so they will never scream at the same time.

the reason of failure:1、自己的判断并不严禁导致的超时。

2、逻辑错误。

learning：因为数据小，可以找到方法解决，就是当循环到较大的时候，可以判断为找不到就好了

#include <iostream>
#include <stdio.h>
#include <string.h>
#include<vector>
#include <queue>
#include <Stack>
#include <math.h>
using namespace std;
const int INF=1e9+7;
int map1[1050][1050];
int pre[30500];
int walk[35000];
int main(){
    //freopen("in.txt","r",stdin);
    int i,j,k,l1,l2,l3,f1,f2,f3,t1,t2,t3;
    int n,m;
    int a,b,c,d;
    cin >> a >> b;
    cin >> c >> d;
    if(b%2==1&&a%2==0&&c%2==0&&d%2==0){
        cout << "-1" << endl;
        return 0;
    }else if(d%2==1&&a%2==0&&c%2==0&&b%2==0){
        cout <<"-1" << endl;
        return 0;
    }
    t1=b;
    while(1){
            //cout << b << "   "<< d<<endl;
        if(b>100000){
            cout << "-1"<<endl;
            return 0;
        }
        if(b==d){
            cout << d <<endl;
    return 0;
        }
        if(b>d){
            d+=c;
        }else{
            b+=a;
        }
    }
    return 0;
}