Reduce to zero

Chef has two integers $X$ and $Y$. Chef wants to perform some operations to make both $X$ and $Y$ zero simultaneously. In one operation, Chef can either: - set $X := 2 \cdot X$ - or set $Y := 2 \cdot Y$ - or set $X := X - 1$ and $Y := Y - 1$ Chef is a little busy with preparing the contest. Help him find the minimum number of operations required to make both $X$ and $Y$ equal to $0$ simultaneousl