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

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

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

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

if i % 2 == 0:
    print(i)
else:
    print(i*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==1 and N!=0:
	N*=2
print(str(N))

Solution (Python):

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

Solution (Python):

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

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

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

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

if (input_num % 2 == 0):
    print(input_num)
else:
    print(input_num * 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)
elif N%2!=0:
    print(2*N)

Solution (Python):


N = input()
a = 2
A = int(N) % 2

if A == 0:
    print(N)
else:
    print(int(N)*a)

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

if a % 2 == 0:
    print(a)
if a % 2 !=0:
    print(a*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%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*(1+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):


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

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

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(10000)


def chkprint(*args):
    names = {id(v):k for k,v in inspect.currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))


def to_bin(x):
    return bin(x)[2:]



dp = None

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

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

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

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

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

Solution (Python):
N = int(input())
if not N % 2:
    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())

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

Solution (Python):


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

    if N % 2 == 0:
        print('{}'.format(N))
    else:
        print('{}'.format(N*2))

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

Solution (Python):
n = int(input())
i = 1
while True:
    ni = n * i
    if ni%2 == 0:
        print(ni)
        break
    i += 1

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

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

Solution (Python):
def getinputdata():

    array_result = []    
    array_result.append(input().split(" "))

    flg = True

    try:
        while flg:

            data = input()

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = True

            else:

                flg = False
    finally:

        return array_result

arr_data = getinputdata()

n= int(arr_data[0][0])

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

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

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

minDiv()

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

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

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

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

Solution (Python):

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

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

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

print(N)

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

Solution (Python):

def gcd(x, y):
    while x % y:
        x, y = y, x % y
    return y

def lcm(x, y):
    return (x * y) // gcd(x, y)


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

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)

def main():
    n = I()

    return n * 2 // fractions.gcd(n,2)



print(main())

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

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

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

assert solve(3) == 6
assert solve(10) == 10
assert solve(999999999) == 1999999998

n = input()
print solve(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=a*2
print(a)

Solution (Python):
def main():
    n = int(input())
    number = n
    while number % 2 != 0:
        number += n
    print(number)
main()

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):
    n = int(n/2)
print(2 * n)

Solution (Python):
from fractions import gcd

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



if __name__ == '__main__':
    main4()

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

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

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

Solution (Python):
import sys


def solve(a):
    if a%2==0:
        return int(a)
    else:
        return a*2

def readQuestion():
    line = sys.stdin.readline().rstrip()
    return int(line)

def main():
    n = readQuestion()
    answer = solve(n)
    print(answer)
    
if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
getGCD = lambda a, b: (getGCD(b, a % b) if a % b else b)

if N < 3:
    print(2)
else:
    print(2 * N // getGCD(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(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())
print(a if a%2==0 else 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):

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

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

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

if __name__ == '__main__':
    r = int(input())
    print(lcm(2, r))

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

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

Solution (Python):


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

Solution (Python):


a = int(raw_input())

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

Solution (Python):


n=int(raw_input())
if n%2:
 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())

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

print(ans)

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

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

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())
i = 1

while True:
  if (n * i) % 2 == 0:
    print(n * i)
    break
  else:
    i += 1

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

Solution (Python):
N = input()
a = int(N)
if a%2 == 0:
    print(abs(a))
else:
    print(abs(a*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):
from sys import stdin
n = int(stdin.readline())
if n%2:
 print n*2
else:
 print n

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 == 0:
		print(int(N))
	else:
		print(int(N*2))
 
if __name__ == '__main__':
	main()

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

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

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

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

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

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

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

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

Solution (Python):


data = int(input())

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

Solution (Python):
N = int(input())
i = N
while True:
    if i % 2 == 0 and i % N ==0:
        print(i)
        break
    i+=i

Solution (Python):
def gcd(a, b):
    if b == 0: return a
    return gcd(b, a % b)
n = float(input())
ans = n*2/gcd(n,2)
print(int(ans))

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

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

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

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())
import fractions
a=2
print(a*N//fractions.gcd(a,N))

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

Solution (Python):
b = int(input())
a = 2
x = 2 * b

r = a % b
while r!=0:
    a = b
    b = r
    r = a % b

print(int(x/b))

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

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

Solution (Python):
def gcd(a, b):
  while b > 0:
    a, b = b, a%b
  return a
def lcm(x, y):
    return (x * y) // gcd(x, y)
N = int(input())
print(lcm(2,N))

Solution (Python):
n=int(raw_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 = input()
N = int(N)
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(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
from collections import deque
import copy

def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline


def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [N] = [int(input_raw[0])]
    if N % 2 == 0:
        print N
    else:
        print N*2

if __name__ == '__main__':
    main()

Solution (Python):
def m():
    n = int(input())
    if n % 2 == 0:
        return n
    return n*2

print(m())

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

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

print(str(N*answer))

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

Solution (Python):
a = int(input())
if a % 2 == 1:
    print(a * 2)
else:
    print(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):
from sys import stdin

a = int(stdin.readline().rstrip())
if a % 2 == 0:
    print(a)
else:
    x = a * 2
    print(x)

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

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

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

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

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

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

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

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

Solution (Python):
a = list(map(int,input().split()))
b = int(a[0])
if b %2 == 0:
    print(b)
else:
    print(b*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(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 == 0:
    print(N)
else:
    print(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 == 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 == 1:
    print(2)
elif 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())
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(n*2)

Solution (Python):

N=int(input())

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

Solution (Python):
N = int(raw_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:
  print(2)
elif N%2 == 0:
  print(N)
else:
  print(2*N)

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

if N%2:
	o=N*2
else:
	o=N

print(o)

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

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

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

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

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

Solution (Python):
a = int(input())
b = 2
x = a * b

if a < b:
    tmp = a
    a = b
    b = tmp

r = a % b
while r != 0:
    a = b
    b = r
    r = a % b

print(int(x/b))

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

Solution (Python):



def gcd(m, n):
    if n == 0:
        return m
    else:
        return gcd(n, m%n)

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

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

if __name__ == '__main__':
    main()

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

print(dst)

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

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

print(re)

Solution (Python):

def gcd(a, b):
    """Calculate the Greatest Common Divisor of a and b.

    Unless b==0, the result will have the same sign as b (so that when
    b is divided by it, the result comes out positive).
    """
    while b:
        a, b = b, a%b
    return a



n = int(input())

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

Solution (Python):
def read_line(*types): return [f(a) for a, f in zip(input().split(), types)]

n, = read_line(int)

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

a = int(input())

def gcd(a, b):

	while b:

		a, b = b, a % b

	return a

g = gcd(a,2)
l = a * 2 // g
print(l)

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):
a = int(input())

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

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


def read_line():
    n = int(input())
    return n


def main():
    n = read_line()
    print(run(n))


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
n = int(input())
if n&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(N*2)

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

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

Solution (Python):
n = int(input())
ans = 0
if n % 2 == 0:
    ans = n
else:
    ans = n * 2
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):
import numpy as np
N=int(input())
def gcd(a,b):
    c=int(np.floor(a/b))
    return a-b*c
if gcd(N,2)==0:
    print(N)
else:
    print(2*N)

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

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

Solution (Python):
n=int(input())
num=n
if(num%n==0 and num%2==0):
    print(num)
else:
    while(num%n!=0 or num%2!=0):
        num+=n
    print(num)

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

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

else:
    print(N * 2)

Solution (Python):


if __name__ == '__main__':
    N = int(input())
    if(N % 2 == 0):
        print(N)

    else:
        print(N * 2)

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

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

Solution (Python):


N=int(input())

N_MAX = int(10e9)

start = N
interval = N

ans = 0

for x in range(N,N_MAX,N):
	
	if x % N == 0 and x % 2 == 0:
		ans = x
		break

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

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

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

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

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

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

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

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 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(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 & 1 == 0:
	print('{0:d}'.format(N))
else:
	print('{0:d}'.format(N*2))

Solution (Python):
import fractions

n = int(input())

g = fractions.gcd(n,2)

l = int((2*n) / g)

print(l)

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

Solution (Python):
N = int(input())
result = N if N&1==0 else N<<1
print(result)

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

Solution (Python):
import math
import numpy as np



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(raw_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 & 1:
    N *= 2
print(N)

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

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

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 gcd(a, b):
    if a < b:
        a, b = b, a
    if b == 0:
        return a
    c = a % b
    return gcd(b, c)
N = int(input())

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

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

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

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