#include <iostream>
typedef long long ll;
using namespace std;
bool ll_is_valid(ll t, ll N, ll x, ll y)
{
return t / x + (t - x) / y >= N;
}
ll f(ll N, ll x, ll y)
{
ll R = 1;
while (!ll_is_valid(R,N,x,y)) R *= 2;
ll L = R / 2;
while(R - L > 1)
{
ll M = (L + R) / 2;
if (!ll_is_valid(M,N,x,y)) {L = M;}
else {R = M;}
}
return R;
}
int main()
{
ll N,x,y;
cin >> N >> x >> y;
if(x > y) swap( x, y );
cout << f(N, x, y) << std::endl;
}
procedure FillArr(var a: array of integer; n, k: integer);
begin
a := ReadArrInteger(n);
Println($'{a.Where(t -> t = k).Count} эл. равны k');
end;
begin
var a: array of integer;
var (n, k) := ReadInteger2('n,k->');
FillArr(a, n, k);
end.