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


from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance





def main():
    n = intin()

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

elif (a == 2):
  	print(2)

elif (a % 2 == 0):
  	print(a)
    
else:
  	print(a * 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):
import sys


def input():
    return sys.stdin.readline()[:-1]







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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from heapq import heappop, heappush, heapify, heappushpop
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N = INT()

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 collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint

import bisect
import copy
import fractions
import math
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) 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 MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers):
    return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers):
    return reduce(LCM, numbers)
def LCM(m, n):
    return (m * n // fractions.gcd(m, n))
def unite(x, y):
    
    x = root(x)
    y = root(y)
    if x == y:
        return
    
    node[x] = y
def same(x,y): return bool(root(x) == root(y))
def root(x):
    if node[x] == x:  
        return x
    else:
        node[x] = root(node[x])  
        return node[x]
def dfs(v):
    
    visited[v] = True
    for v2 in range(n):
        if graph[v][v2] == False:  
            continue
        if visited[v2] == True:  
            continue
        dfs(v2)

print(LCM(2, II()))

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

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

print(lcm(n, 2))

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):


n = int(input())

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

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

for i in range(N, 2*N + 1, N):
    if i % N == 0 and i % 2 == 0:
        print(i)
        break

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

Solution (Python):

import sys
from math import *
from itertools import *
from collections import *
from functools import *
try:
    from math import gcd
except Exception:
    from fractions import gcd


def solve(N: int):
    g = gcd(N, 2)
    return N * 2 // g


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

if __name__ == '__main__':
    main()

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


n = int(input())

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

Solution (Python):


n = int(input())

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

Solution (Python):


n = int(input())

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

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

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

Solution (Python):


n = int(input())

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

Solution (Python):


n = int(input())

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

Solution (Python):


n = int(input())

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

Solution (Python):


n = int(input())

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

Solution (Python):


n = int(input())

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

Solution (Python):


n = int(input())

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

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

Solution (Python):
import sys
input = sys.stdin.readline

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

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

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

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

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


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

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

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):


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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
N = int(input())
import fractions as f
g = f.gcd(2,N)
print(int(2*N/g))

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

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

Solution (Python):

import sys
INF = float("inf")


def solve(N: int):
    if N & 1:
        print(N << 1)
    else:
        print(N)
    return


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

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

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

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

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

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())
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):
k=int(input())
n=k
while True:
    if n%2==0 and n%k==0:
        break
    n+=k
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())

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

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

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

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin
N=int(stdin.readline().rstrip())
if N%2==0:
  print(N)
else:
  print(N*2)

Solution (Python):


import sys


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

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

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

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

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

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

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


if __name__ == '__main__':
    print(solve(input()))

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

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

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

print(lcm(2,N))

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

Solution (Python):
def multiple_of_2_and_N(N: int) -> int:
    return N if N % 2 == 0 else 2*N


if __name__ == "__main__":
    N = int(input())
    ans = multiple_of_2_and_N(N)
    print(ans)

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

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

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

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

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

Solution (Python):

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

Solution (Python):
def multiple_of_2_and_N(N: int)->int:
    return N if N % 2 == 0 else 2 * N


if __name__ == "__main__":
    N = int(input())
    ans = multiple_of_2_and_N(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):
N=int(input())

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

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

m = 10000000000000000

for i in range(n,m,n):
	if i % 2 == 0:
		print(i)
		break

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

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

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

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

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

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

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

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

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

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

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

if N<=2:
  print(2)
else:
  for i in range(N,2*N+1,N):
    if i%N==0 and i%2==0:
      print(i)
      break

Solution (Python):
def rgcd(m, n):
    if n == 0:
        return m

    return rgcd(n, m % n)


N = int(input())

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

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

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

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

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

print(ans)
print()

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

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

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

while True:
    if (result % n == 0) & (result % 2 == 0):
        print(result)
        break
    result = result * 2

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

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

Solution (Python):
import fractions
from sys import stdin
n=int(stdin.readline().rstrip())
print(int(2*n/fractions.gcd(2,n)))

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


if __name__ == "__main__":
    main()

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

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