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



Sample input:
3


Sample output:
6

Submission status: Accepted

Solution code:
# Multiple of 2 and N
print((lambda n: [n if n % 2 == 0 else 2 * n for i in range(1)][0])(int(input())))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
def get_gcd(a, b): #最大公約数を求める関数
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    else:
        return get_gcd(b, a % b)
def get_lcm(a, b, gcd): #みたまんまそういうやつです
    lcm = a * b // gcd
    return lcm
print(int((2 * n) / get_gcd(2,n)))

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n  = int( input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
#coding: utf-8
N = int(input())
print([N*2, N][N%2==0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

else:
    print(2 * n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

else:
    print(2 * n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - Multiple of 2 and N
https://beta.atcoder.jp/contests/abc102/tasks/abc102_a

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


from fractions import gcd

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


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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# encoding: utf-8
N = int(input())
if N % 2: print(2 * N)
else: print(N)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
#102a
n=int(input())
print(n if n%2==0 else n*2)

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

else:
    print(N*2)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N= int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# https://beta.atcoder.jp/contests/abc102/tasks/abc102_a

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
#print(x)

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

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


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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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


print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print ans(int(raw_input()))

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
num = int(input())

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

else:
    print(num*2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
N = int(raw_input())

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

Submission status: Accepted

Solution code:
a=int(input())
b=int(a/2)
if b*2==a:
  print(a)
else:
  print(a*2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
i = int(input())

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

Submission status: Accepted

Solution code:
N=int(input())
if N%2==1 and N!=0:
	N*=2
print(str(N))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
N=int(input())
ans=0
if N%2==0:
   ans=N
else:
   ans=N*2
 
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
s = int(input())
if s % 2 == 0 and s % 2 == 0:
  print(s)
elif s % 2 != 0 and s % 2 != 0:
  print(s*2)

Submission status: Accepted

Solution code:
# 2とNの最小公倍数
N = int(input())
if N % 2 == 0:
    print(N)
else:
    print(N*2)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_num = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: UTF-8

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

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

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

n = int(input())

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

Submission status: Accepted

Solution code:
N=int(input())
if N/2==N//2:
    print(N)
else:
    print(N*2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)

# Debug output
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))

# Binary converter
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

def main():
    #入力
    N = int(input())

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

minDiv()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#jiaofhaosfhao
n=int(input())
if(n%2==1):
	n*=2
print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*-coding=utf-8-*-
n = int(input())
if n%2:
    n *= 2
print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

if N % 2 != 0:
    N *= 2

print(N)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from fractions import gcd

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#nが偶数の場合は2でも割り切れるので場合わけ

n=int(input())

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

Submission status: Accepted

Solution code:
# input
N = int(input())

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

Submission status: Accepted

Solution code:
def main4():
    buf = int(input(""));
    if int(buf%2) == 0:
        print(buf);
    else:
        print(buf*2);



if __name__ == '__main__':
    main4()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
# coding: utf-8
a=int(input())
print(a if a%2==0 else a*2)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
# coding: utf-8
input = int(input())
print(str(input*2 if input % 2 != 0 else input))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(raw_input())

ret=2*a if a%2==1 else a
print ret

Submission status: Accepted

Solution code:
#abc102a

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
i = 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
a = int(N)
if a%2 == 0:
    print(abs(a))
else:
    print(abs(a*2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
n = int(stdin.readline())
if n%2:
 print n*2
else:
 print n

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
 
def main():
	N = int(input())
	if N % 2 == 0:
		print(int(N))
	else:
		print(int(N*2))
 
if __name__ == '__main__':
	main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

data = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())# your code goes here
if(n%2 == 0):
	print(n)
else:
	print(n*2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

print(m())

Submission status: Accepted

Solution code:
N = int(input())

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

print(str(N*answer))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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