Problem:
 Score : 100 points    Problem Statement You are given a positive integer N .
Find the minimum positive integer divisible by both 2 and N .      Constraints  1 \leq N \leq 10^9  All values in input are integers.         Input Input is given from Standard Input in the following format:  N       Output Print the minimum positive integer divisible by both 2 and N .        Sample Input 1 3      Sample Output 1 6  6 is divisible by both 2 and 3 .
Also, there is no positive integer less than 6 that is divisible by both 2 and 3 .
Thus, the answer is 6 .       Sample Input 2 10      Sample Output 2 10       Sample Input 3 999999999      Sample Output 3 1999999998

Solution (Python):
n=int(input());print(2**(n%2)*n)

Solution (Python):
N = int(input())
if N%2==0:
  print(N)
else:print(N*2)

Solution (Python):
N = int(input())
if N % 2 == 0:
  print(N)
else:
  print(N * 2)

Solution (Python):
import sys

def main():
  input = sys.stdin.readline
  N = int(input())
  if N % 2 == 0:
    print(N)
  else:
    print(2*N)


if __name__ == '__main__':
  main()

Solution (Python):
def main() -> None:
    N = int(input())
    if N % 2 == 0:
        print(N)
    else:
        print(N * 2)


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(2 * N)

Solution (Python):
s = int(input())
if s%2 == 0:
    print(s)
else:
    print(2*s)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(2*n)

Solution (Python):
N = input()
print N*(N%2+1)

Solution (Python):
a=int(input())
if a%2==0:
  print(a)
else:
  print(2*a)

Solution (Python):
n = int(input())

if n%2 == 0:
    print(n)
else:
    print(int(n*2))

Solution (Python):
n = int(input())
ans = n if n % 2 == 0 else n * 2
print(ans)

Solution (Python):
n = int(input())
if n%2==0:
  print(n)
else:
  print(n*2)

Solution (Python):
int_n = int(input())

print(2 * int_n if int_n % 2 != 0 else int_n)

Solution (Python):
N = int(input())
print(N) if N % 2 == 0 else print(N*2)

Solution (Python):

N = int(input())

if N%2 == 1:
    print(N*2)
else:
    print(N)

Solution (Python):
N = int(input())

if N%2==0:
    ans = N
else:
    ans = 2*N

print(ans)

Solution (Python):
n = int(input())

if n % 2 == 0:
    print(n)
else :
    print(n * 2)

Solution (Python):
n=int(input())
if n%2==0:
  print(n)
else:
  print(n*2)

Solution (Python):
n=int(input())

if n%2:
    print(n*2)
else:
    print(n)

Solution (Python):
N = int(input())
if N % 2 == 1:
  print(N * 2)
else:
  print(N)

Solution (Python):
n = int(input())
if n % 2 == 0:
  print(n)
else:
  print(n*2)

Solution (Python):
N=int(input())
if N%2==0:
    print(N)
else:
    print(2*N)

Solution (Python):
N = int(input())

def gcd(m, n):
  while n:
    m, n = n, m%n
  return m

def lcm(m, n):
  print(m * n // gcd(m, n))

lcm(N,2)

Solution (Python):
N = int(input())

sum = 0
count = 1
while True:
    sum = N * count
    if sum % 2 == 0 and sum % N == 0:
        print(sum)
        break
    count += 1

Solution (Python):
N = int(input())

if N % 2 == 0:
  print(N)
else:
  print(2 * N)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(n*2)

Solution (Python):
n = int(input())
if n % 2 != 0:
    print(2*n)
else:
    print(n)

Solution (Python):
n = int(input())

if n%2 != 0:
    print(2*n)
else:
    print(n)

Solution (Python):
n=int(input())
print(n+n%2*n)

Solution (Python):
n=int(input())
if n%2:
  ans=2*n
else:
  ans=n
print(ans)

Solution (Python):
n = int(input())
if n % 2 == 0:
    ans = n
else:
    ans = 2*n
print(ans)

Solution (Python):
N = int(input())
print(N) if N%2 == 0 else print(N*2)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(N*2)

Solution (Python):
N = int(input())

def gcd(m, n):
  while n:
    m, n = n, m%n
  return m

def lcm(m, n):
  return int((m * n) / gcd(m, n))

print(lcm(N,2))

Solution (Python):
a = int(input())
if a%2 == 0:
    print(a)
else:
    print(a*2)

Solution (Python):
n = int(input())

if n%2==0:
    print(n)
else:
    print(n*2)

Solution (Python):
n =int(input())
if n %2 != 0:print(2*n)
else:print(n)

Solution (Python):
n=int(input())
if n%2==0:
  print(n)
else:print(n*2)

Solution (Python):
N = int(input())
print(N * 2 if N % 2 else N)

Solution (Python):
n = int(input())
print(n if (n % 2 == 0) else (n * 2))

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(n*2)

Solution (Python):

import sys



def solve(lines):
    N = int(lines.pop(0))
    if N % 2 == 0:
        print(N)
    else:
        print(N*2)














lines = [x.strip() for x in sys.stdin.readlines()]




solve(lines)

Solution (Python):
n = int(input())
if n % 2 == 0:
  print(n)
else:
  print(n*2)

Solution (Python):
N = int(input())
if N % 2 == 1:
  print(2 * N)
else:
  print(N)

Solution (Python):
A=int(input())
if(A%2):
  print(2*A)
else:
  print(A)

Solution (Python):
N = int(input())
if N % 2!=0: 
	print(2*N)
else:
  print(N)

Solution (Python):
def main():
    N = int(input())
    if N % 2 == 0:
        print(N)
    else:
        print(N * 2)


main()

Solution (Python):
N = int(input())
if N%2 == 1:
  print(N*2)
else:
  print(N)

Solution (Python):
N = int(input())

if N % 2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
N = int(input())
print(N if N % 2 == 0 else 2 * N)

Solution (Python):
n=int(input())
print(2*n if(n%2==1) else n)

Solution (Python):
""" AtCoder """

import sys
input = sys.stdin.readline
 
N = int(input())

if N%2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
num = input()
print(num if num%2 == 0 else num << 1)

Solution (Python):

num = input()
print(num if num%2 == 0 else num << 1)

Solution (Python):
N = int(input())
print(N if N % 2 == 0 else 2 * N)

Solution (Python):
num = input()
print(num if num%2 == 0 else num * 2)

Solution (Python):

n = int(input())

print( n if n%2 == 0 else n*2)

Solution (Python):
n = int(input())

print(n if n%2==0 else n*2)

Solution (Python):


def main():
    N = int(input())

    print(N if N % 2 == 0 else N * 2)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())

print(2 * n if n % 2 != 0 else n)

Solution (Python):
n = int(input())
print(n * 2 if n % 2 else n)

Solution (Python):

n = int(input())

if n % 2 == 0:
    print(n)
else:
    print(2 * n)

Solution (Python):
N=int(input())
print(N if N%2==0 else N*2)

Solution (Python):
def gcd(x, y):
    while y != 0:
        x, y = y, x % y
    return x

n = int(input())
print((n * 2) // gcd(n, 2))

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
N = int(input())
if N % 2 == 0: print(N)
else: print(N*2)

Solution (Python):
n=int(input())
if n%2==0:
  print(n)
else:
  print(n*2)

Solution (Python):
N = int(input())
print(N if N % 2 == 0 else N * 2)

Solution (Python):
n=int(input())
print(n if n%2!=1else 2*n)

Solution (Python):
N = int(input())
if N % 2 == 0: print(N)
else: print(2 * N)

Solution (Python):
N = int(input())
if N%2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
def main(n):
    print(n*(1+(n%2!=0)))

n = int(input())
main(n)

Solution (Python):
N = int(input())
if(N%2 == 0):
  print(N)
else:
  print(N*2)

Solution (Python):
n = int(input())
if n % 2 == 1:
    print(n * 2)
else:
    print(n)

Solution (Python):
n = int(input())

if n%2==0:
    print(n)
else :
    print(n*2)

Solution (Python):
a=int(input())
if a%2==0:
  print(a)
else:
  print(a*2)

Solution (Python):
n = int(input())
if n%2==0:
    print(n)
else:
    print(2*n)

Solution (Python):
x=int(input())
print(x*((x%2!=0)+1))

Solution (Python):
N=int(input())
if N%2==1 :
  N*=2
print(N)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(n*2)

Solution (Python):
n=int(input())
print(2*n if n%2 else n)

Solution (Python):
def gcd(a, b):
	while b:
		a, b = b, a % b
	return a

def lcm(a, b):
	return a * b // gcd (a, b)


N = int(input())
print(lcm(2,N))

Solution (Python):
N = int(input())
ans = N
if N % 2 != 0:
    ans = N * 2

print(ans)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(N*2)

Solution (Python):
import sys

input = sys.stdin.readline
N = int(input())
print(N if N % 2 == 0 else N * 2)

Solution (Python):
N = int(input())
if N % 2 == 0:
  print(N)
else:
  print(2 * N)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(2 * N)

Solution (Python):
N=int(input())
if N%2:
  print(2*N)
else:
  print(N)

Solution (Python):
n = int(input())
print(n if n%2 == 0 else n*2)

Solution (Python):
n = int(input())
print(n if n % 2 == 0 else 2 * n)

Solution (Python):
a = int(input())

if(a%2==0):
    print(a)
else:
    print(a*2)

Solution (Python):
n=int(input())
if n%2==0:
    print(n)
else:
    print(n*2)

Solution (Python):
n = int(input())
print(n if n % 2==0 else n * 2)

Solution (Python):
def main():
    n = int(input())
    if n % 2 == 0:
        print(n)
    else:
        print(n * 2)


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
if N%2==0:
    print(N)
else:
    print(N*2)

Solution (Python):
a = int(input())
if a%2 == 0:
    print(a)
else:
    print(a*2)

Solution (Python):
n=int(input())
print(n if n%2==0 else n*2)

Solution (Python):
n=int(input())
if n/n==1 and n%2==0:
    print(n)
else:
    print(n*2)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(N*2)

Solution (Python):
n = int(input())
print(n if n%2==0 else 2*n)

Solution (Python):
n = int(input())
ans = n if n % 2 == 0 else 2 * n
print(ans)

Solution (Python):
a=int(input())
print(2*a if a%2>0 else a)

Solution (Python):
N = int(input())

if N % 2 == 0:
  print(N)
elif N % 2 != 0:
  print(N*2)

Solution (Python):
N = int(input())
if N%2 == 1:
    print(2*N)
else:
    print(N)

Solution (Python):
n = int(input())

if n%2 == 1:
    print(n*2)
else:
    print(n)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(N*2)

Solution (Python):
a = int(input())
if a % 2 == 0:
  print(a)
else:
  print(a * 2)

Solution (Python):
n = int(input())
if n%2==0:
        print(n)
else:
        print(n*2)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(n*2)

Solution (Python):



def main():
    """Function."""
    n = int(input())
    if n % 2 == 0:
        print(n)
    else:
        print(n*2)


if __name__ == "__main__":
    main()

Solution (Python):
def abc102_a():
    n = int(input())
    return [n, 2*n][n%2]


print(abc102_a())

Solution (Python):

N = int(input())
if N % 2 == 0:
  print(N)
elif N % 2 == 1:
  print(2*N)

Solution (Python):
n=int(input())

if n%2==0:
    print(n)
else:
    print(2*n)

Solution (Python):
N = int(input())
 
if N % 2 == 0:
  print(N)
else:
  print(2 * N)

Solution (Python):
n = int(input())
print(n if (n % 2 == 0) else (2 * n))

Solution (Python):
n = int(input())
print(n if n%2==0 else 2*n)

Solution (Python):
def gcd(a, b):
	while b:
		a, b = b, a % b
	return a
def lcm(a, b):
	return a * b // gcd (a, b)
n = int(input())
print(lcm(2,n))

Solution (Python):
N = int(input())
print(N if N%2 == 0 else N*2)

Solution (Python):
def gcd(a, b):
	while b:
		a, b = b, a % b
	return a
def lcm(a, b):
	return a * b // gcd (a, b)
n = int(input())
print(lcm(2,n))

Solution (Python):
N = int(input())

if (N % 2 == 0) :
	print(N)
else :
	print(2*N)

Solution (Python):
n = int(input())
if n % 2 == 1:
  n *= 2
print(n)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(n * 2)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(int(2*N))

Solution (Python):
N = int(input())
if N%2 == 0:
  print(N)
else:
  print(2*N)

Solution (Python):
n = int(input())

if n%2 == 0:
    print(n)
else:
    print(2*n)

Solution (Python):
n=int(input())
if n%2==0:
    ans=n
else:
    ans=n*2
print(ans)

Solution (Python):
N=int(input())

print(N if N%2==0 else N*2)

Solution (Python):
N = int(input())

if N%2 == 0:
    print(N)
elif N%2 == 1:
    print(N*2)

Solution (Python):
N = int(input())
if N%2 == 0:
  print(N)
else:
  print(int(2*N))

Solution (Python):
n=int(input())
if n%2==0:
  print(n)
else:
  print(n*2)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(n * 2)

Solution (Python):
n = int(input())
if n%2==0:
    print(n)
else:
    print(n*2)

Solution (Python):
n=int(input())
if n%2==0:
  print(n)
else:
  print(n*2)

Solution (Python):
n = int(input())
if n%2==0:
    print(n)
else:
    print(2*n)

Solution (Python):
N = int(input())

if( N % 2 == 1):
  print( N * 2)
  
else:
  print(N)

Solution (Python):
N=int(input())

if N%2==0:
    print(N)
else:
    print(2*N)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(2*n)

Solution (Python):
n=int(input());print(n*(1+(n%2!=0)))

Solution (Python):
a = int(input())
if a%2==0:
  print(a)
else:
  print(2*a)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(N * 2)

Solution (Python):
n = int(input())

if n % 2:
    print(2 * n)
else:
    print(n)

Solution (Python):
N = int(input())
print(N if N%2 == 0 else N*2)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(n * 2)

Solution (Python):
n = int(input())
print(n*2 if n%2 else n)

Solution (Python):
a = (int)(input())
if(a%2):
  print(a*2)
else:
  print(a)

Solution (Python):
n = int(input())
print(n) if n % 2 == 0 else print(n*2)

Solution (Python):
N = int(input())
if N % 2 == 0:
  print(N)
else:
  print(2 * N)

Solution (Python):
a = int(input())
if a % 2 == 0:
    print(a)
else:
    print(2*a)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
n=int(input())
if(n%2==0):
  print(n)
else:
  print(2*n)

Solution (Python):
a = int(input())
if a % 2 == 0:
  print(a)
else:
  print(a * 2)

Solution (Python):
def gcd(a,b):
    rem = a % b
    while rem != 0:
        a = b
        b = rem
        rem = a % b
    return b


def lcm(a,b):
    return int((a*b)/gcd(a,b))

n = int(input())
print(lcm(2,n))

Solution (Python):
n = int(input())

print(n if n % 2 == 0 else 2 * n)

Solution (Python):
n=int(input());print(n%2*n+n)

Solution (Python):
n = int(input())
if n%2 == 0:
    print(n)
else:
    print(n*2)

Solution (Python):
N = int(input())
print(N) if N%2==0 else print(N*2)

Solution (Python):
a = int(input())
if a % 2 == 0:
  print(a)
else:
  print(a * 2)

Solution (Python):
n = int(input())
if n % 2 != 0:
    print(2 * n)
else:
    print(n)

Solution (Python):
def gcd(a, b):
    while b:
        a, b = b, a % b
    return a
  
def lcm(x, y):
    return (x * y) // gcd(x, y)

print(lcm(int(input()), 2))

Solution (Python):
n = int(input())

if n%2 ==0:
  print(n)
else:
  print(n*2)

Solution (Python):
N = int(input())
if N % 2 == 0:
	print(N)
else:
	print(2*N)

Solution (Python):
a=input();print a+a%2*a

Solution (Python):
N = int(input())


if N % 2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
N=int(input())
print(N if N%2==0 else 2*N)

Solution (Python):
n=int(input())
if(n%2==0):
  print(n)
else:
  print(2*n)

Solution (Python):
n=int(input())

if n%2==0:
    print(n)
else:
    print(n*2)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):

print((lambda n: [n if n % 2 == 0 else 2 * n for i in range(1)][0])(int(input())))

Solution (Python):
def gcd(i, j):
	return i * j / lcm(i, j)
def lcm(i, j):
	if j > i:
		return lcm(j, i)
	if i % j == 0:
		return j
	k = i % j
	return lcm(j, k)

N = input()
print gcd(2, N)

Solution (Python):
def gcm(i, j):
	k = lcm(i, j)
	return min(i, j) * max(i, j) / k
def lcm(i, j):
	if j > i:
		return lcm(j, i)
	if i % j == 0:
		return j
	k = i % j
	return lcm(j, k)

N = input()
print gcm(2, N)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(2 * N)

Solution (Python):
n=int(input())
print([n,n*2][n%2==1])

Solution (Python):
n=int(input())
if n%2==0:
  print(n)
else:
  print(2*n)

Solution (Python):
n = int(input())
if n % 2 ==0:
  print(n)
else:
  print(2*n)

Solution (Python):
n=int(input())
print(n if n%2==0 else n*2)

Solution (Python):
n = int(input())
def get_gcd(a, b): 
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    else:
        return get_gcd(b, a % b)
def get_lcm(a, b, gcd): 
    lcm = a * b // gcd
    return lcm
print(int((2 * n) / get_gcd(2,n)))

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(N*2)

Solution (Python):
N = int(input())

if N % 2 == 0:
    ans = N
else:
    ans = 2 * N
print(ans)

Solution (Python):
n=int(input())
if n%2==0:
    print(n)
else:
    print(2*n)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
N = int(input())

if N % 2 == 0:
    print(N)
else:
    print((2 * N))

Solution (Python):


n  = int( input())

if n %2==0:
  print(n)
else:
  print(n*2)

Solution (Python):
n = int(input())
if n%2==1:
    print(n*2)
else:
    print(n)

Solution (Python):
n = int(input())

print((n,2*n)[n%2])

Solution (Python):
a=0
N=int(input())
if N%2==1:
	a=2*N
if N%2==0:
	a=N
print(a)

Solution (Python):
N = int(input())
print(N if N%2 == 0 else 2*N)

Solution (Python):
N = int(input())

if N % 2:
    print(N*2)
else:
    print(N)

Solution (Python):

N = int(input())
print([N*2, N][N%2==0])

Solution (Python):
n=int(input())
if n%2==0:
  print(n)
else:
  print(2*n)

Solution (Python):
n = int(input())
print(n if n%2 == 0 else n*2)

Solution (Python):
N=int(input())
print((N%2+1)*N)

Solution (Python):
n = int(input())
if n%2 == 0:
    print(n)
    exit()
print(n*2)

Solution (Python):
N = int(input())
    
if N % 2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
N=int(input())
if N%2==1:
	print(2*N)
else:
	print(N)

Solution (Python):
N = int(input())

if N%2==0:
  print(N)
else:
  print(2 * N)

Solution (Python):
n = int(input())

if n%2==0:
    print(n)

else:
    print(2 * n)

Solution (Python):
N = int(input())
print(N if N % 2 == 0 else 2 * N)

Solution (Python):
n = int(input())
if n%2 == 0:
  print(n)
else:
  print(n*2)

Solution (Python):
N=int(input())
if N%2==0:
	print(N)
else:
	print	(2*N)

Solution (Python):
n = int(input())
if n%2 == 0:
  print(n)
else:
  print(2*n)

Solution (Python):
n = int(input())

if n % 2 == 0:
    print(n)

else:
    print(2 * n)

Solution (Python):
N = int(input())

if N % 2 == 0:
    print(N)
else:
    print(N * 2)

Solution (Python):
n = int(input())
if n%2==0:
  print(n)
else:
  print(n*2)

Solution (Python):
N=int(input())
if N%2==1:
    print(2*N)
else:
    print(N)

Solution (Python):
n = int(input())
if n%2 == 0:
    print(n)
else:print(2*n)

Solution (Python):
from sys import stdin

N = int(stdin.readline().rstrip())

if N % 2 == 0:
    print(N)
else:
    print(2 * N)

Solution (Python):
n = int(input())
if n%2 == 0:print(n)
else:print(n*2)

Solution (Python):
n=int(input())
print(n) if n%2==0 else print(n*2)

Solution (Python):
n = int(input())
if n%2 == 0:
  print(n)
else:
  print(2*n)

Solution (Python):
n=int(input());print(n+n*(n%2))

Solution (Python):
n = int(input())

if (n % 2) == 0:
  print(n)
else:
  print(n * 2)

Solution (Python):
N = int(input())
if N%2==0:
	print(N)
else:
	print(N*2)

Solution (Python):

"""
A - Multiple of 2 and N
https://beta.atcoder.jp/contests/abc102/tasks/abc102_a

"""
import sys
from sys import stdin
input = stdin.readline


from fractions import gcd

def main(args):
    N = int(input())
    g = gcd(N, 2)
    print(N * 2 // g)


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):
n = int(input())
if n%2 == 0:
  print(n)
else:
  print(2*n)

Solution (Python):
N = int(input())

if N % 2 == 0:
  print(N)
else:
  print(2 * N)

Solution (Python):
N = int(input())
if (N%2 == 0):
  print(N)
else:
  print(2*N)

Solution (Python):
N = int(input())

if N % 2 == 0:
    print(N)
else:
    print(N * 2)

Solution (Python):
n = int(input())
if n%2==0:
    print(n)
else:
    print(n*2)

Solution (Python):

N = int(input())
if N % 2: print(2 * N)
else: print(N)

Solution (Python):
a=int(input())
if a%2==0:print(a)
else:print(2*a)

Solution (Python):
n = int(input())
if n%2 == 0:
    print(int(n))
else:
    print(int(n*2))

Solution (Python):
a=int(input());print(a+(a%2>0)*a)

Solution (Python):
n=int(input())
ans=n
if n%2==1:
    ans=2*n
print(ans)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(2*n)

Solution (Python):
N = int(input())
if N % 2 == 0:
  print(N)
else:
  print(2*N)

Solution (Python):
a = int(input())
print(a if a%2==0 else a*2)

Solution (Python):
N = int(input())
print(N if N % 2==0 else N*2)

Solution (Python):
a=int(input())
if(a%2==0):print(a)
else:print(a*2)

Solution (Python):
n=int(input())
print(n if not n%2 else n*2)

Solution (Python):
n = int(input())
print([n*2,n][n%2==0])

Solution (Python):
N=input()
N=int(N)
if N%2==0:
    print(N)
else:
    print(N*2)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(str(n))
else:
    print(str(n*2))

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(str(n))
else:
    print(str(n*2))

Solution (Python):
n = int(raw_input())
if n % 2 == 1:
  print n * 2
else:
  print n

Solution (Python):
n = int(input())
if n % 2 == 0:
	print(n)
else:
	print(n*2)

Solution (Python):
a=int(input())
if a%2==0:print(a)
else:print(a*2)

Solution (Python):
a = int(input())
print(a if a%2==0 else a*2)

Solution (Python):
n=int(input())
if n%2==0:
  print(n)
else:
  print(2*n)

Solution (Python):
n=int(input())
if n%2==1:
  print(2*n)
else:
  print(n)

Solution (Python):
n=int(input())
if n%2==0:
  print(n)
else:
  print(2*n)

Solution (Python):
N = int(input())
print(N if N%2==0 else N*2)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(2*n)

Solution (Python):
N = int(input())

print(N * 2 ** (N % 2))

Solution (Python):

n=int(input())
print(n if n%2==0 else n*2)

Solution (Python):
def solution(x):
    if (x & 1) == 0:
        return x
    else:
        return x << 1

def main():
    n = int(raw_input().strip())
    print solution(n)

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
if N%2 == 0:
  print(N)
elif N%2 == 1:
  print(2*N)

Solution (Python):
a = int(input())

if a % 2 == 0:
    print(a)
else:
    print(a*2)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(N * 2)

Solution (Python):
n = int(input())

if n%2==0:
  print(n)
else:
  print(2*n)

Solution (Python):
n = int(input())
print(n*2 if n%2 else n)

Solution (Python):
N=int(input())
if(N%2==0):
  print(N)
else:
  print(2*N)

Solution (Python):
N=int(input())
if (N%2)==0:
  print(N)
else:
  print(N*2)

Solution (Python):
N = int(input())
i = 2
if N % 2 == 0:
    print(N)
else:
    print(N * 2)

Solution (Python):
n=int(input())

if n%2==0:
    print(n)
else:
    print(n*2)

Solution (Python):
n = int(input())
print(n*(n%2+1))

Solution (Python):
N = int(input())

if N % 2 == 0:
    print(N)

else:
    print(N*2)

Solution (Python):
N = int(input())

if N % 2 == 0:
  print(N)
else:
  print(N*2)

Solution (Python):
N = int(input())
if N % 2 == 0 :
    print(N)
else :
    print(2*N)

Solution (Python):
N = int(input())
if N % 2 == 0:
    ans = N
else:
    ans = N * 2
print(ans)

Solution (Python):
N = int(input())
print(N if N%2==0 else 2*N)

Solution (Python):
def gcd(a, b):
	while b:
		a, b = b, a % b
	return a
def lcm(a,b):
    return a * b // gcd (a,b)

N=int(input())
print(lcm(N,2))

Solution (Python):
def GCD(a, b):
    if(a % b == 0):
        return(b)
    return(GCD(b, a % b))

N = int(input())
ret = 0
if(N < 2):
    ret = GCD(2, N)
else:
    ret = GCD(N, 2)
print(2 * N // ret)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
N=int(input())
if N %2==0:
    print(N)
else:
    print(N*2)

Solution (Python):
N = int(input())
print(N*2 if N%2 else N)

Solution (Python):
N = int(input())

if N%2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
N = int(input())

if N % 2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
N = int(input())

if N % 2 == 0:
  print(N)
else:
  print(N*2)

Solution (Python):
N= int(input())

if N%2==0:
    print(N)
else:
    print(2*N)

Solution (Python):
n = int(input())
m = 2

if n%m == 0:
    print(n)
else:
    print(n*m)

Solution (Python):


if __name__ == '__main__':
    n = int(input())

    if n % 2 == 0:
        print(n)
    else:
        print(2 * n)

Solution (Python):
N=int(input())
if N%2==1:
    print(N*2)
else:
    print(N)

Solution (Python):
N = int(input())

if N % 2 == 0:
    print(N)
else:
    print(2 * N)

Solution (Python):
N = int(input())

print(2 * N if N % 2 else N)

Solution (Python):
N = int(input())

if N % 2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
N = int(input())

if N == 1 or N == 2:
  print(2)
  
elif N % 2 == 0:
  print(N)
  
else:
  print(N * 2)

Solution (Python):
a=input()
b=int(a)
if b%2==0:
    print(b)
elif b%2==1:
    print(b*2)

Solution (Python):


if __name__ == "__main__":
    N = int(input())
    if N % 2 != 0:
        print(N*2)
    else:
        print(N)

Solution (Python):
import fractions
 
def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

N = int(input())
print(lcm_base(N, 2))

Solution (Python):
N = int(input())

if N % 2 == 1:
    print(N*2)
else:
    print(N)

Solution (Python):
n = int(input())
if n % 2 == 0:
  print(n)
else:
  print(n * 2)

Solution (Python):
n = int(input())

if n % 2 == 0:
    print(n)
else:
    print(n * 2)

Solution (Python):
n = int(input())
if n % 2: print(n * 2)
else: print(n)

Solution (Python):
n=int(input())
if n%2==0:
    print(n)
else:
    print(2*n)

Solution (Python):
N = int(input())

if N % 2 == 0:
  print(N)
else:
  print(2*N)

Solution (Python):
x=int(input())


if x%2 == 0:
	print(x)
else:
	print(x*2)

Solution (Python):


from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def main():
    N = int(input())
    if N % 2 == 0:
        print(N)
    else:
        print(2 * N)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(2 * n)

Solution (Python):
n = int(input())
if n % 2 == 0:
  print(n)
else:
  print(2 * n)

Solution (Python):
N = int(input())
if(N%2 == 1):
  a = 2*N 
else:
  a = N
print(a)

Solution (Python):
n=int(input())
print(n+n*(n%2))

Solution (Python):
N = int(input())

if N % 2 != 0:
    answer = N * 2
    print(answer)
else:
    print(N)

Solution (Python):
N = int(input())
if N%2 == 0:
  print(N)
else:
  print(N*2)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(2 * n)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(2 * n)

Solution (Python):
n = int(input())
if(n%2 ==0):
    print(n)
else:
    print(n*2)

Solution (Python):
n=int(input())
print(n*2 if n%2 else n)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(N * 2)

Solution (Python):
n = int(input())
if n%2 ==0:
    print(n)
else:
    print(n*2)

Solution (Python):
N = int(input())
print([N, 2*N][N%2==1])

Solution (Python):
def main():
    n = int(input())
    if n % 2:
        n = n * 2
    print(n)
main()

Solution (Python):
n = int(input())
print(n if n % 2 == 0 else n*2)

Solution (Python):
n=int(input())
print(n if n%2==0 else n*2)

Solution (Python):
n = int(input())

if n % 2 == 0:
  print(n)
else:
  print(n * 2)

Solution (Python):
n = int(input())
if n%2 == 0:
    print(n)
else:
    print(n*2)

Solution (Python):
import math

n = int(input())
if n%2 == 0:
    print(n)
else:
    print(2*n)

Solution (Python):
n = int(input())

if (n % 2) == 0:
    print(n)
else:
    print(n * 2)

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n)
else:
    print(n*2)

Solution (Python):
m = int(input())
if m %2 == 1:res = m*2
else:res = m
print(res)

Solution (Python):
a=int(input())
print(a if a%2<1 else a*2)

Solution (Python):
N = int(input())
z = N
if N % 2 != 0:
    z = 2 * N
print(z)

Solution (Python):
N = int(input())

if N%2 == 0:
    print(N)
else:
    print(N*2)

Solution (Python):
n = int(input())

if n%2 == 0:
    answer = n
else:
    answer = 2*n
print(answer)

Solution (Python):
N = int(input())

i=N
while True:
    if (i % 2 == 0):
        print(i)
        break
    i += N

Solution (Python):
N=int(input())
if N%2==1:
  N=2*N
print(N)

Solution (Python):
N = int(input())

if N % 2 == 0:
    print(N)
else:
    print(N * 2)

Solution (Python):
n = int(input())
if n % 2 == 0:print(n)
else: print(2*n)

Solution (Python):
n = int(input())
if n%2==0:
    print(n)
else :
    print(2*n)

Solution (Python):
A = int(input())

if (A % 2) == 0:
  B = A
else:
  B = A * 2
  
print(B)

Solution (Python):
t=int(input())
if t%2==0:
 print(t)
else:
 print(t*2)

Solution (Python):
n = int(input())
if n % 2==0:
    print(n)
else:
    print(2*n)

Solution (Python):
n = int(input())
if n%2==0:
    print(n)
else:
    print(n*2)

Solution (Python):
A=int(input())
if A%2==1:
    A*=2
print(A)

Solution (Python):
n = int(input())

if (n % 2) == 1:
  print(n*2)
else:
  print(n)

Solution (Python):
n = int(input())
print(2 * n if n % 2 == 1 else n)

Solution (Python):
n = int(input())
if n%2==0:
  print(n)
else:
  print(2*n)

Solution (Python):
n = int(input())

if (n%2 == 0):
    print(n)
else:
    print(2*n)

Solution (Python):
N = int(input())

if N % 2 == 0:
    ans = N
else:
    ans = 2 * N


print(ans)

Solution (Python):
print((lambda x:x*((x%2)+1))(int(input())))

Solution (Python):
N = int(input())
n = N*2
while n > N:
    if n%4 == 0 and n != N:
        n //= 2
        continue
    break
print(n)

Solution (Python):
n = int(input())

print(n if n % 2 == 0 else 2*n)

Solution (Python):
a = input()
print(a if a % 2 == 0 else a * 2)

Solution (Python):
n = int(raw_input())
 
if n % 2 == 0:
    print n
else:
    print 2*n

Solution (Python):
def ans(n):
	if n%2 != 0: return n*2
	else: return n

print ans(int(raw_input()))

Solution (Python):
n = int(input())

if n % 2 == 0:
    print(n)
elif n % 2 == 1:
    print(2*n)

Solution (Python):
import math
n = int(input())
print([n, 2*n][n % 2 > 0])

Solution (Python):
num = int(input())

if num % 2 == 0:
    print(num)
else:
    print(num*2)

Solution (Python):
N = int(input())
if N % 2 == 1:
    print(N*2)
else:
    print(N)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    ans = N * 2
    print(ans)

Solution (Python):
n = int(input())
if n%2:
    print(2*n)
else:
    print(n)

Solution (Python):
if __name__ == '__main__':
    a = int(input())
    for i in range(a, 10 ** 10, a):
        if i % 2 == 0:
            print(i)
            break

Solution (Python):
n = int(input())

if n%2==0:
    print(n)
else:
    print(n*2)

Solution (Python):
N = int(input())

print(2 * N if N % 2 else N)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(2*N)

Solution (Python):
num = int(input())

if num % 2 == 0:
    print(num)

else:
    print(num*2)

Solution (Python):
n = int(input())
i = n % 2
 
if i == 0:
  print(n)
else:
  print(n*2)

Solution (Python):

if __name__ =='__main__':
    a = input()
    try:
        x = int(a)
    except:
        exit(1)

    if(x % 2 != 0):
         x = x*2
    
    print(x)

Solution (Python):
N = int(raw_input())

if N%2 == 0:
    print N
else:
    print N*2