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:
#!/usr/local/bin/python3
# -*- coding: utf-8 -*-

N = int(input())

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

Submission status: Accepted

Solution code:
from sys import stdin

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

a = int(input())

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

# A_Multiple_of_2_and_N.py

N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

print(o)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! /usr/bin/env python
# coding: UTF-8

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

Submission status: Accepted

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

print(dst)

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

Submission status: Accepted

Solution code:
from fractions import gcd
num = int(input())
ans = gcd(2, num)
print(int(2 * num / ans))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(re)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())
if n&1:
    print(2*n)
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())
ans = 0
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:
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    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:
    b = a
else:
    b = 2*a
print(b)

Submission status: Accepted

Solution code:
# 2とNのどちらでも割り切れる最小の整数

N=int(input())

N_MAX = int(10e9)

start = N
interval = N

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
print(2 * N if N % 2 != 0 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:
#!/usr/bin/env python
# -*- coding:utf-8 -*-

N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:

N = int(input())

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

Submission status: Accepted

Solution code:
import fractions

n = int(input())

g = fractions.gcd(n,2)

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

print(l)

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())
result = N if N&1==0 else N<<1
print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import numpy as np

#line = input().split()
#N = int(line[0])
N = int(input())
#C = int(line[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N =int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


n = int(input())

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

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

Submission status: Accepted

Solution code:
number = input()
a = int(number)

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

Submission status: Accepted

Solution code:
def main():
    N = int(raw_input())

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

main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


def main():
    N = int(input().strip())
    print(lcm(N, 2))


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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__=="__main__":
  N = int(input())
  print(N if N%2==0 else 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:
# -*- coding: utf-8 -*-

N = int(input())

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

Submission status: Accepted

Solution code:
#coding: utf-8

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

Submission status: Accepted

Solution code:
def solve(n):
    if n % 2 == 1:
        return 2 * n
    return n

if __name__ == "__main__":
    n = int(input())
    print(solve(n))

Submission status: Accepted

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

print(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())
ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    if n % 2 == 1:
        print(n * 2)
    else:
        print(n)
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
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 == 1:
    print(2)
elif N == 2:
    print(2)
elif 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:
#input
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:
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(2*n)

Submission status: Accepted

Solution code:
N = int(input())

count = N
while True:
    if count % 2:
        count += N
    else:
        break

print(count)

Submission status: Accepted

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

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

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:
    Ans = N
else:
    Ans = N*2

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n= int(input())

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

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

print lcm(n,2)

Submission status: Accepted

Solution code:
inn = int(input())

if inn%2 == 0:
    print(inn)
else:
    print(inn*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(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:
# -*- coding: utf-8 -*-

N = int(input())

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

Submission status: Accepted

Solution code:
#coding: utf-8
def check(n):
    result = n
    if n % 2 == 0:
        result = n
    else:
        result = n * 2
    return result

if __name__ == "__main__":
    n = int(input())
    print(check(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:
#!/usr/bin/python

import sys

def main(argv):
    for line in sys.stdin:
        N = int(line.rstrip("\n"))
        if N % 2 == 0:
            print(N)
        else:
            print(2 * N)

if __name__ == "__main__":
    main(sys.argv)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    num = int(input())

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

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())
a = N
while True:
    if a % 2 == 0 and a % N == 0:
        print(a)
        break
    a += N

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
str = input()
n = int(str)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

if N % 2 == 1:
    m = N * 2
else:
    m = N

print(m)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

n = int(input())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jul  1 20:09:43 2018
ABC102A
@author: maezawa
"""

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

Submission status: Accepted

Solution code:
Num = int(input())

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

Submission status: Accepted

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

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

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#! /usr/bin/env python3

n = int(input())

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout
input = lambda: stdin.readline().rstrip()
write = stdout.write

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

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

main()

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())
ans = 0
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())

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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().strip())

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

Submission status: Accepted

Solution code:
n=int(input())

if n%2==1:
	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:
def ketanowa(p):
    ans = 0
    p = str(p)
    for i in p:
        ans += int(i)
    return ans


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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# AtCoder Beginner Contest


if __name__ == '__main__':
    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:
from functools import reduce
from fractions import gcd
N = int(input())
print(N * 2 // gcd(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:
args = int(input())

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

Submission status: Accepted

Solution code:
from sys import stdin

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
res = 2 * n
if n % 2 == 0:
    res = min(res, n)
print(res)

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

Submission status: Accepted

Solution code:
N = int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

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:
def main():
    N = int(input())
    if N%2==1:
        return 2*N
    else:
        return N

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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: Runtime Error

Solution code:

N = input()

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

print(i)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(int(input)*2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
using System;
using System.Globalization;
using System.IO.Pipes;
using System.Runtime.InteropServices;

namespace ConsoleApp2
{
    class Program
    {
        static void Main(string[] args)
        {
            int a = int.Parse(Console.ReadLine());

            if (a % 2 == 0) Console.WriteLine(a);
            else Console.WriteLine(a * 2);
        }

    }
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
print(max(A)-min(A))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()
n = int(s)

arrays = []

max_num = 0

v = input().split()
for i in range(n):
    arrays.append(int(v[i]))

for i in range(len(arrays)):
    max_num = max(max_num, arrays[i])

min_num = max_num

for i in range(len(arrays)):
    min_num = min(min_num,arrays[i])

answer = max_num - min_num

print(answer)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
x = []
b = 0
ans = 0

for i in range(n):
    x.append(a[i] - i-1)
x = sorted(x)


if n%2 == 0:
    b = (x[n//2]-x[(n-1)//2])/2
else:
    b = (x[(n//2)])

for i in range(n):
    ans += abs(a[i]-b-i-1)

print(ans)

Submission status: Runtime Error

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

def n_lcm(*numbers):
    print(reduce(lcm_base,numbers,1))
    
n_lcm(2,int(input()))

Submission status: Runtime Error

Solution code:
import math

N = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
print(map(lambda x:x*((x%2*2),int(input()))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
na = [0]*n
for i in range(n):
    na[i] = a[i]-(i+1)
mid = sum(na)//n
mid1 = mid+1
ans = 0
ans1 = 0
for i in range(n):
    ans += abs(na[i]-mid)
    ans1 += abs(na[i]+mid1)
print(min(ans, ans1))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

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

Submission status: Runtime Error

Solution code:

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

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

resolve()

Submission status: Runtime Error

Solution code:

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

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

Submission status: Runtime Error

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