Strange Minimization

You are given an integer $N$. Find another integer $X (X > N)$ such that the following conditions are satisfied : 1. $X$ is not a multiple of $N$. 2. The value $|gcd(N,X)-lcm(N,X)|$ is as small as possible. If there are multiple answers for $X$, print any. For reference, $gcd(u, v)$ is the [greatest common divisor](https://en.wikipedia.org/wiki/Greatest_common_divisor) between $u$ and $v$, whi