#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { ll a, b, n, m; cin >> a >> b >> n >> m; ll ans = 0; if(a >= b){ ans = b + (a-b)/(n+1); }else{ ans = a + (b-a)/(m+1); } cout << ans << endl; return 0; }