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_str = input()
n = int(n_str)

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(2*n)

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

Solution (Python):

N = int(input())


a = N
while a % 2 != 0:
    a += N
else:
    print(a)

Solution (Python):
import fractions
N = int(input())
def lcm(A, B):
    return int((A * B) / fractions.gcd(A, B))
print(lcm(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):
def main():
    n = int(input())

    if n%2:
        print(n*2)
    else:
        print(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(n*2)

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

print(N * (N % 2 + 1))

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

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

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

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

Solution (Python):
import sys

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

    return  0

if __name__ == "__main__":
    solve()

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

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())
ans = n
while(1):
  if ans%2==0 and ans%n==0:
    break
  ans += 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 == 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(N * 2)

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

Solution (Python):
import fractions
n=int(input())
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)

print(lcm(2, n))

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

Solution (Python):
N = (int)(input())
ans=N
while 1:
    if ans%2==0:
        print(ans)
        exit()
    ans+=N

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

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

Solution (Python):
n = int(input())
import fractions
print(2*n//fractions.gcd(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())
ans = n
if n%2: ans = ans*2
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(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(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):
N = int(input())
if N%2==1:
    print(2*N)
else:
    print(N)

Solution (Python):
n=int(input())
print(2*n) if 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 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):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

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

Solution (Python):
from fractions import gcd
n = int(input())
print(2 * n // gcd(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())
print(2*n 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(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 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())
if N%2==0:
    print(N)
else:
    print(N*2)

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

Solution (Python):
def gcd(a, b):
	"""Compute the greatest common divisor of a and b"""
	while b > 0:
		a, b = b, a % b
	return a

def lcm(a, b):
	"""Compute the lowest common multiple of a and b"""
	return a * b // gcd(a, b)

def resolve():
	n = int(input())
	print(lcm(n, 2))
resolve()

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

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

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

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())

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

Solution (Python):
n = int(input())
contador = 0
res = 0
while(True):
    contador += n
    if contador % 2 == 0 and contador % n == 0:
        res = contador
        break;
print(res,'\n')

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

Solution (Python):
import fractions
n = int(input())
print(2*n//fractions.gcd(2,n))

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18


n = I()
print(n*2//gcd(n, 2))

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

print(n*2 if n%2==1 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(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(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 print(n*2)

Solution (Python):
from fractions import gcd
n = int(input())
print(2*n//gcd(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 N*2)

Solution (Python):

import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    import math
    n=int(input())
    print(2 * n // math.gcd(2, n))
resolve()

Solution (Python):
from math import gcd
n=int(input())
print(2*n//gcd(n,2))

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

Solution (Python):

import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    import fractions
    n=int(input())
    print(n * 2 // fractions.gcd(n, 2))
resolve()

Solution (Python):

"""
Created on Wed May 13 17:07:20 2020

@author: shinba
"""

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*(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:
  print(n)
else:
  print(n*2)

Solution (Python):
import sys
import math
import bisect

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):
n = int(input())
print(n if n % 2 == 0 else n * 2)

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

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

print(ans)

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

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

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

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

if __name__ == '__main__':

    ABC_102_A()

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())
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:
    print(2*N)
else:
    print(N)

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

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

Solution (Python):
from fractions import gcd

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

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

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(n*2)

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(2*A)

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

Solution (Python):


import sys






















def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n = ii()
    print(2 * n) if n % 2 == 1 else print(n)


if __name__ == "__main__":
    main()

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(2 * n)

Solution (Python):
n=int(input())
if max(2,n)%2==0:
    print(max(2,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):
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())
m = max(2, n)
for i in range(m, 2*n+1, m):
    if i % 2 == 0:
        print(i)
        exit(0)

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 print(n*2)

Solution (Python):
a=int(input());print(a*(a%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(2*N)

Solution (Python):
from fractions import gcd

n=int(input())

print(n*2//gcd(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())
ans=n+n%2*n
print(ans)

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

Solution (Python):
def gcd(m, n):
    x, y = max(m, n), min(m, n)
    if x % y == 0:
        return y
    else:
        while x % y != 0:
            z = x % y
            x, y = y, z
        else:
            return z


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


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())
print(n*2 if n%2==1 else n)

Solution (Python):

n = input()
if int(n) % 2 == 0:
    ans = int(n)
else:
    ans = int(n) * 2
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(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 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 == 0:
    print(n)
else:
    print(n*2)

Solution (Python):
import fractions
n = int(input())
print(int(2*n / fractions.gcd(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):
def gcd(n, m):
    
    a = max(n,m)
    b = min(n,m)
    while b:
        a, b = b, a % b
    return a

n = int(input())
print(2*n//gcd(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(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):
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop

import collections

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(2*n if n%2==1 else 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(n*2)

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

Solution (Python):
n = int(input())
while n <= (10**24):
  if (n % 2) == 0:
    print(n)
    break
  n += n

Solution (Python):

import sys


def solve(N: int):
    print(N * 2 if N % 2 else N)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)


if __name__ == '__main__':
    main()

Solution (Python):
import fractions
a = int(input())
print((a * 2 ) // fractions.gcd(a, 2))

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


def gcd(a, b):
    x = max(a, b)
    y = min(a, b)
    mod = x % y
    if mod == 0:
        return y

    return gcd(y, mod)


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


print(lcm(2, N))

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

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


def gcd(a,N):
    while N!=0:
        a,N = N, a%N
    return a


print(int(a*N/gcd(a,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):
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):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

Solution (Python):
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(N*2)

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

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

Solution (Python):
import sys

IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list(map(lambda x: x-1, MII()))

INIT_VAL = 0
DP2 = lambda d1, d2: [[INIT_VAL]*d2 for _ in range(d1)]
DP3 = lambda d1, d2, d3: [[[INIT_VAL]*d3 for _ in range(d2)] for _ in range(d1)]

DIVC = lambda x, y: -(-x//y)
DIVF = lambda x, y: x//y

def main():
    n = II()
    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):
x = input()
x = int(x)
if x%2 == 1:
    x = 2*x
    print(x)
else:
    print(x)

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

Solution (Python):
import fractions

N = int(input())

print(int(N*2 / fractions.gcd(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*2)
else:
    print(n)

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

Solution (Python):
import fractions
n=int(input())
print((2*n)//fractions.gcd(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):

import sys

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

if __name__ == '__main__':
    main()

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 euclid(a, b):
    if b == 0:
        return a
    else:
        return euclid(b, a%b)

def multiple(a, b):
    return a*b // euclid(a, b)

N = int(input())

print(multiple(N,2))

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

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

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

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):
i=int(input())
if i%2==0:
    print(i)
else:
    print(2*i)

Solution (Python):
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

n = ni()

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(2*N)

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

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

Solution (Python):
import fractions

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

Solution (Python):
import math
import collections
import sys


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

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

def lcm(a, b):
    return a // gcd(a, b) * b
n=I()
ans=lcm(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 == 0:
  print(n)
else:
  print(2*n)

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())
if n % 2 == 0:
    print(n)
else:
    print(2*n)

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

print((2*n) // fractions.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:
    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):
nim = int(input())
if nim%2 == 0 :
  print(nim)
else :
  print(2*nim)

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

Solution (Python):
import fractions
N = int(input())
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)

print(lcm(2, N))

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

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

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

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

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

def lcm(a, b):
    return a // gcd (a, b) * 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):
from fractions import gcd
n = int(input())
print(n * 2 // gcd(2,n))

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

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

Solution (Python):
n = int(input())
c=n
d=0
for i in range(n, 99999999999999, n):
    if i%2==0 and i%c==0:
        print(i)
        break

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

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

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

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

Solution (Python):
line = input()
num = [int(n) for n in line.split()][0]
smaller_divisible_number = num
if num%2 != 0:
    smaller_divisible_number *= 2
print(smaller_divisible_number)

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

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

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

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

else:
  print(N*2)

Solution (Python):
n = int(input())
def getmdc(x, y):
    while(y):
        x, y = y, x % y
    return x
def mmc2(x):
    return x * 2 // getmdc(x, 2)
print(mmc2(n))

Solution (Python):
def main():
    a, b = 2, int(input())
    ta, tb = a, b
    if b == 0: print(0)
    while a%b != 0:
       a, b = b, a%b
    print(int((ta*tb)/b))
main()

Solution (Python):
n = int(input())
iterator = n
while True:
    if iterator % n == 0 and iterator % 2 == 0:
        print(iterator)
        break
    else:
        iterator += n

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

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

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:
    i = N
else:
    i = N*2
print(i)

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

if N == 1 or N == 2:
    print(2)
else:
    if N % 2 == 0:
        i = N
    else:
        i = N*2
    while i % N != 0:
        i += 2
    print(i)

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):
def resolve():
    N = int(input())
    if N % 2 == 0:
        print(N)
    else:
        print(2 * N)

if '__main__' == __name__:
    resolve()

Solution (Python):
def q1():
    N = int(input())
    d, m = divmod(N,2)
    if m==0:
        ans = N
    else:
        ans = N * 2
    print(ans)


if __name__ == '__main__':
    q1()

Solution (Python):
n = int(input())
print(n*2 if n%2 != 0 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 == 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==0:
  print(N)
else:
  print(N*2)

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

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

Solution (Python):



N = int(input())


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


if __name__ == "__main__":
    main()

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())


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


if __name__ == "__main__":
    main()

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

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):

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n = I()
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 gcd(a, b):
    while b != 0:
        a, b = b, a % b
    return a


def ngcd(a):
    res = a[0]
    for i in range(len(a)):
        if res != 1:
            res = gcd(a[i], res)
    return res


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


def nlcm(a):
    res = a[0]
    for i in range(len(a)):
        res = lcm(res, a[i])
    return res

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

Solution (Python):
from fractions import gcd
n = int(input())

print(2 * n // gcd(2, n))