Problem:


Score : 100 points

Problem Statement

Takahashi wants to print a document with N pages double-sided, where two pages of data can be printed on one sheet of paper.

At least how many sheets of paper does he need?

Constraints

N is an integer.

1 \leq N \leq 100

Input

Input is given from Standard Input in the following format:

N

Output

Print the answer.

Sample Input 1

5

Sample Output 1

3

By printing the 1-st, 2-nd pages on the 1-st sheet, 3-rd and 4-th pages on the 2-nd sheet, and 5-th page on the 3-rd sheet, we can print all the data on 3 sheets of paper.

Sample Input 2

2

Sample Output 2

1

Sample Input 3

100

Sample Output 3

50



Sample input:
5


Sample output:
3

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n = int(readline())

print(n//2+n%2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import queue
from collections import defaultdict
 
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):#階乗
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):#コンビネーション
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def printQueue(q):
	r=q
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)

n = readInt()
if n%2==1:
	print((n+1)//2)
else:
	print(n//2)

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

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

N = ir()
answer = (N+1) // 2
print(answer)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 157a
n = int(input())

print((n + 1) // 2)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    if n%2:
        print(n//2+1)
    else:
        print(n//2)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input()
a=(int(n)+1)//2
print(a)

Submission status: Accepted

Solution code:
import math

N = int(input())
P = math.ceil(N/2)
print(P)

Submission status: Accepted

Solution code:
n=int(input())
if(n//2==n/2):
    m=n//2
else:
    m=n//2+1
print(m)

Submission status: Accepted

Solution code:
N = int(input())

s = -( - N // 2 )

print(s)

Submission status: Accepted

Solution code:
N = int(input())

ans = N // 2

if N%2 == 1:
  ans += 1
  
print(ans)

Submission status: Accepted

Solution code:
def solve():
    n = int(input())
    print((n+1)//2)

solve()

Submission status: Accepted

Solution code:
def solve(n):
    return (n+1)//2

n = int(input())
print(solve(n))

Submission status: Accepted

Solution code:
N = int(input())
if N % 2 == 0:
  print(int(N / 2))
else:
  print(int(N // 2 + 1))

Submission status: Accepted

Solution code:


N = int(input())
print(N//2 + N % 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

if n % 2 == 1:
    print(n//2 +1)
else:
    print(n//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
temp = ((int(input()) + 2)-1)/2

print(int(temp))

Submission status: Accepted

Solution code:
N=int(input())

if N%2==0:
    page=N/2
    
else:
    page=N/2+1
    
print(int(page))

Submission status: Accepted

Solution code:
n = int(input())

print(n//2+n%2)

Submission status: Accepted

Solution code:
N = int(input())
if N % 2 == 0:
    print(N//2)
else:
    print(N//2+1)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
import math
x = input()
page = (int(x)+1) // 2
print(page)

Submission status: Accepted

Solution code:
N = int(input())

print(int(N / 2 + N % 2))

Submission status: Accepted

Solution code:
i = int(input())

if i%2 == 0:
    print(i//2)
else:
    print((i//2) + 1)

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

N = int(input())

a = int(N / 2)
if N % 2 == 1:
    a +=1
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(-(-int(input()) // 2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

a = N // 2
b = N % 2
print(a + b)

Submission status: Accepted

Solution code:
N=int(input())

if N%2==1:
    print(N//2+1)
else:
    print(N//2)

Submission status: Accepted

Solution code:
N = int(input())
x = N // 2

if N % 2 == 0:
    print(x)
else:
    print(x + 1)

Submission status: Accepted

Solution code:
n = int(input())
print(int(n/2+0.9))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    n = int(input())
    ans = (n + 1) //2
    print(ans)


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
import math
import sys

s = int(sys.stdin.readline().rstrip())

print(math.ceil(s / 2))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

print(n//2+1 if n%2 != 0 else n//2)

Submission status: Accepted

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

Submission status: Accepted

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

print(math.ceil(N /2))

Submission status: Accepted

Solution code:
N=int(input())

print(-(-N//2))

Submission status: Accepted

Solution code:
N = int(input())
print(N//2 if N % 2 == 0 else N//2+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

n = int(input())

print(math.ceil(n/2))

Submission status: Accepted

Solution code:
x = int(input())

print(x//2+x%2)

Submission status: Accepted

Solution code:
ans = (int(input()) - 1) // 2 + 1
print(ans)

Submission status: Accepted

Solution code:
a=int(input())
print(sum(divmod(a,2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input()) 
print(int(x/2)+ 1 if x % 2 != 0 else int(x/2))

Submission status: Accepted

Solution code:
def main():
    import sys
    import math
    import collections
    def input():
        return sys.stdin.readline()[:-1]
    N=int(input())
    print(math.ceil(N/2))
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
i = input()
a = int(i)//2
b = int(i)%2
print(a+b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
N = int(input())
Ans = math.ceil(N/2)
print(Ans)

Submission status: Accepted

Solution code:
from math import ceil

n = int(input())
print(ceil(n / 2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num=int(input())
if num%2==0:
  print(int(num/2))
else:
  print(int((num+1)/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

if N%2==0:
    print(N//2)
else:
    print(N//2+1)

Submission status: Accepted

Solution code:
import math
n = int(input())

m = n//2
if n % 2 == 0:
    print(m)
else:
    print(m+1)

Submission status: Accepted

Solution code:
n = int(input())

m = n//2
if n%2 == 0:
    print(m)
else:
    print(m+1)

Submission status: Accepted

Solution code:
import sys
N = int(input()) + 1
ans = N // 2
 
print(ans)

Submission status: Accepted

Solution code:
print(int((int(input())/2)+0.6))

Submission status: Accepted

Solution code:
n = int(input())

if n%2==1:
	print(n//2+1)
else:
	print(n//2)

Submission status: Accepted

Solution code:
n = int(input())

if n%2 == 0:
    ans = n//2
else:
    ans = (n+1)//2

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

if N%2 == 0:
  print(N//2)
elif N%2 !=0:
  print(N//2+1)

Submission status: Accepted

Solution code:
s=int(input())
if s%2==0:
  print(s//2)
else:
  print(s//2+1)

Submission status: Accepted

Solution code:
N=int(input())
A=N//2+N%2
print(A)

Submission status: Accepted

Solution code:
import sys;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=math.floor,math.ceil
from collections import deque
Yes=lambda b:print('Yes')if b else print('No');YES=lambda b:print('YES')if b else print('NO')
is_even=lambda x:True if x%2==0 else False

def main():
  n=aint()
  print(int(ceil(0.5*n)))
    
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
print( round( float( input() ) / 2 + .1 ) )

Submission status: Accepted

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


##計算、出力
if N % 2 == 0:##偶数の場合
  
  a = int(N/2)
  print(a)
  
else:##そうじゃなかった場合 ->奇数の場合
  N = N + 1
  a = int(N/2)
  print(a)

Submission status: Accepted

Solution code:
n = int(input())
ans = (n + 1)//2
print(ans)

Submission status: Accepted

Solution code:
import sys
import math
# input処理を高速化する
input = sys.stdin.readline

N=int(input())

q,mod = divmod(N,2)

print(q+mod)

Submission status: Accepted

Solution code:
import math

N = int(input())
print(math.ceil(N / 2))

Submission status: Accepted

Solution code:
print((-int(input())//2)*-1)

Submission status: Accepted

Solution code:
import math
n=int(input())

print(math.ceil(n/2))

Submission status: Accepted

Solution code:
def solve():
  print(n//2 + n % 2)
  return



n = int(input())
#n, m = [int(s) for s in input().split(" ")]
solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
def main():
    N = int(input())
    print(math.ceil(N/2))
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
page=int(input())
re=int((page/2.0)+0.5)
print(re)

Submission status: Accepted

Solution code:
n = int(input())
import math
print(math.ceil(n / 2))

Submission status: Accepted

Solution code:
n = int(input())

if n % 2 == 0:
    print(int(n / 2))
elif n % 2 == 1:
    print(int((n+1) / 2))

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
input = sys.stdin.buffer.readline

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))


def main():
    N = II()
    p = -(-N // 2)
    print(p)




if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
import math 
N = int(input())
print(math.ceil(N/2))

Submission status: Accepted

Solution code:
N=int(input())
M=0
M=int(N/2)
N=int(N%2)
if N>0:
    print(M+1)
else:
    print(M)

Submission status: Accepted

Solution code:
n=int(input())
if n%2==1:
    print(str(n//2+1))
else:
    print(str(n//2))

Submission status: Accepted

Solution code:
s = int(input())
print(s//2 + s%2)

Submission status: Accepted

Solution code:
N = int(input())

if N % 2 == 0:
    print(N//2)
else:
    print(N//2 + 1)

Submission status: Accepted

Solution code:
val = int(input())
print((val+1)//2)

Submission status: Accepted

Solution code:
n = int(input())
ans = (n + 1) // 2;
print(ans)

Submission status: Accepted

Solution code:
import math

n = int(input())

print(math.ceil(n/2))

Submission status: Accepted

Solution code:
n = int(input())
ans = n//2
if n/2 == ans:
  print(ans)
else:
  print(ans+1)

Submission status: Accepted

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

Submission status: Accepted

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

N = int(input())

print(-(-N // 2))

Submission status: Accepted

Solution code:
import math

n = int(input())

if n%2 == 0:
    print(n//2)
else:
    print(math.floor(n//2)+1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
print ((N + 1) // 2)
#sjdjsdajkjkafffjfjfjfjfjjfjf

Submission status: Accepted

Solution code:
n = int (input ())
print ((n + 1) // 2)
# .................

Submission status: Accepted

Solution code:
N = int(input())
if N%2 == 0:
    print(N//2)
else:
    print(int((N+1)/2))

Submission status: Accepted

Solution code:
N = int(input())

if N % 2 == 1:
  print((N+1)//2)

else:
  print(N//2)

Submission status: Accepted

Solution code:
N = int(input())
       
if N%2 == 0:
  print(N//2)
else:
  print(N//2 +1)

Submission status: Accepted

Solution code:
n=int(input())


if n%2 ==0:

    print(int(n/2))

else:
    print(int(n/2+1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N =int(input())

print(N//2+N%2)

Submission status: Accepted

Solution code:
N = int(input())
if N % 2 == 0:
  print(int(N/2))
else:
  print(int((N/2))+1)

Submission status: Accepted

Solution code:
import math
N=int(input())
ans=math.ceil(N/2)
print(ans)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(n%2 + n//2)

Submission status: Accepted

Solution code:
N = int(input())
ans = int((N + 1) / 2)
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
rem = n // 2
div = n % 2

if div == 0:
  print(rem)
else:
  print(rem+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
if  N%2 == 0:
    print(N//2)
else:
    print(N//2+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
if n%2==1:
  n+=1
print("{0}".format(int(n/2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
print((((-1)*n)//2)*(-1))

Submission status: Accepted

Solution code:
import math

print(math.ceil(int(input())/2))

Submission status: Accepted

Solution code:
N = int(input())
a = int((N + 1)/2)
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print((N+1)// 2)

Submission status: Accepted

Solution code:
i = int(input())

if i % 2 == 0:
  print(int(i/2))
else:
  print(int(i/2) +1)

Submission status: Accepted

Solution code:
N = int(input())
if N%2==0:
    print(N//2)
else:
    print(N//2 + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

if n%2==0:
    print(n//2)
else:
    print((n//2)+1)

Submission status: Accepted

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

  print(b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
if N%2 == 0:
    print(N//2)
else:
    print((N//2)+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

if n%2==0:
  print(int(n/2))
else:
  print(int((n//2)+1))

Submission status: Accepted

Solution code:
n = int(input())

if n % 2 == 0:
    print(n // 2)
else:
    print(n // 2 + 1)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

N = ri()

print((N+1) // 2)

Submission status: Accepted

Solution code:
n=int(input())
if n&1:
    print((n+1)//2)
else:
    print(n//2)

Submission status: Accepted

Solution code:
n = int(input())+1
ans = int(n/2)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=int(input())
print(S%2+S//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(-(-int(input())//2))

Submission status: Accepted

Solution code:

url = "https://atcoder.jp//contests/abc157/tasks/abc157_a"

def main():
    inp = int(input())
    a, b = divmod(inp, 2)
    print(a+b)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

N = input()
paper = math.ceil(int(N) / 2)
print(paper)

Submission status: Accepted

Solution code:
N = int(input())
t = N // 2
r = N - 2 * t
print(t+r)

Submission status: Accepted

Solution code:
num =int(input())
ans = num//2
ans +=max(num%2,0)
print(ans)

Submission status: Accepted

Solution code:
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v):
    print(["Yes", "No"][not v])


# エントリーポイント
def main():
    N = input(int)
    print(ceil(N / 2))


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

Solution code:
n=int(input())
if n%2==0:
  print(int(n/2))
elif n%2==1:
  print(int((n+1)/2))

Submission status: Accepted

Solution code:
N = int(input())

a = N // 2
s = N % 2
if (s == 0):
    print(a)
else:
    print(a + 1)

Submission status: Accepted

Solution code:
N = int(input())
answer = N // 2 + N % 2
print(answer)

Submission status: Accepted

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

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    
    n = ii()
    print((n+1)//2)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
def main():
    n = int(input())
    if n % 2 == 0:
        print(n//2)
    else:
        print(int(n//2) + 1)
            
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
from sys import stdin
N=list(map(int,stdin.readline().strip().split()))[0]
print(N//2+N%2)

Submission status: Accepted

Solution code:
N = int(input())
if N % 2 == 0:
    print(N//2)
else:
    print((N+1)//2)

Submission status: Accepted

Solution code:
import math

n = int(input())

n = math.ceil(n/2)

print(n)

Submission status: Accepted

Solution code:
N = int(input())

print(N//2 + N%2)

Submission status: Accepted

Solution code:
number=int(input())
print(number//2 if number%2==0 else (number//2)+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = n//2 +n%2

print(ans)

Submission status: Accepted

Solution code:
def main():
  x = int(input())
  if(x % 2 == 0):
    print(x//2)
  else:
    print(x//2 + 1)

if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
s = int(input())
if s % 2 == 0:
    print(s // 2)
else:
    print(s//2 + 1)

Submission status: Accepted

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

Submission status: Accepted

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

ans = n // 2 + n % 2;

print(ans);

Submission status: Accepted

Solution code:
n=int(input())
import math
print(math.ceil(n/2))

Submission status: Accepted

Solution code:
num = int(input())
a = num//2 + num % 2
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = N/2

if ans.is_integer():
    print(int(ans))
else:
    print(int(ans)+1)

Submission status: Accepted

Solution code:
N = int(input())
if N%2==0:
	print(N//2)
else:
	print((N//2)+1)

Submission status: Accepted

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

def main():
    *N, = map(int, open(0).read().split())
    N = N[0]
    N = -(-N // 2)
    print(N)


main()

Submission status: Accepted

Solution code:
from math import floor
N = int(input())
print((floor(N/2))+(N%2))

Submission status: Accepted

Solution code:
#!/usr/bin/python3

n = int(input())

print(n // 2 + n % 2)

Submission status: Accepted

Solution code:
N = int(input())
S = N // 2

if N % 2 == 0:
    print(S)
elif N % 2 == 1:
    print(S+1)

Submission status: Accepted

Solution code:
# AtCoder
N = int(input())
if N % 2 != 0:
    print(N//2+1)
else:
    print(N//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

from math import ceil

n = int(readline())
print(ceil(n / 2))

Submission status: Accepted

Solution code:
n = int(input())

print((int((int(n) / 2))) + (int((int(n) % 2))))

Submission status: Accepted

Solution code:
n = int(input())

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

else:
    print(n // 2 + 1)

Submission status: Accepted

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

    print(n//2 + n%2)

main()

Submission status: Accepted

Solution code:
N = int(input())

print(N // 2 + (N % 2))

Submission status: Accepted

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

N = INT()

print(-(-N//2))

Submission status: Accepted

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

N = INT()

print( N//2+1 if N%2 != 0 else N//2)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    if n % 2 == 0:
        print(n // 2)
    else:
        print(n // 2 + 1)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())

from math import ceil

print(int(ceil(n/2)))

Submission status: Accepted

Solution code:
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


def main():
    N = int(input())
    print(math.ceil(N/2))
        


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

if N%2 == 0:
    print(N//2)
else:
    print((N - 1)//2 + 1)

Submission status: Accepted

Solution code:
N = int(input())
if N % 2 == 0:
    print(N // 2);
else:
    print(N // 2 + 1)

Submission status: Accepted

Solution code:
n = int(input())
import math
print(math.ceil(n/2))

Submission status: Accepted

Solution code:
n = int(input())
print(int(n/2 + 0.5))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
n = int(input())
print(math.floor((n + 1) / 2))

Submission status: Accepted

Solution code:
n = int(input())

if n%2 == 0:
  print(int(n/2))
else:
  print(int((n+1)/2))

Submission status: Accepted

Solution code:
a = int(input())

if a % 2 == 0:
    print( int(a/2) )

else:
    print( int((a+1)/2) )

Submission status: Accepted

Solution code:
n = int(input())
if n % 2 == 0:
    p = int(n / 2)
else:
    p = int(n/2) + 1
print(p)

Submission status: Accepted

Solution code:
N=int(input())
if N%2==0:
    print(N//2)
else:
    print(N//2+1)

Submission status: Accepted

Solution code:
n = int(input())
print((n-1)//2+1)

Submission status: Accepted

Solution code:
a = int(input())

print(a//2 + a % 2)

Submission status: Accepted

Solution code:
import math 
n=int(input())
print(math.ceil(n/2))

Submission status: Accepted

Solution code:
n= int(input())
eq=0
if n%2!=0:
	eq=(n+1)//2
	print(eq)
else:
	print(n//2)

Submission status: Accepted

Solution code:
N = int(input())

print(-(-N//2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
if N%2 == 0:
  print(int(N/2))
else:
  print(int(N/2) + 1)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
from sys import stdin
import math

n = int(stdin.readline().rstrip())

print(math.ceil(n / 2))

Submission status: Accepted

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