Problem A. The Monster

时间限制 1000 ms   内存限制 256 MB

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.

输入数据

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).

输出数据

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

样例

提交

请先 登录

© 2025 FAQs Contact About