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:
print((int(input())+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())
if N % 2 ==0:
    print(math.floor(N/2))
else:
    print(math.floor(N/2)+1)

Submission status: Accepted

Solution code:
n = int(input())

num = int(n / 2)
if n % 2 == 1:
  num += 1

print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = int(open(0).read())
print(n//2+(n%2!=0))

Submission status: Accepted

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

Submission status: Accepted

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

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+1)//2)

Submission status: Accepted

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

Submission status: Accepted

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

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())
res = int(N / 2)
if N % 2 != 0:
  res += 1
print(res)

Submission status: Accepted

Solution code:
import math

N=int(input())

print(math.ceil(N/2))

Submission status: Accepted

Solution code:
import sys

input = lambda: sys.stdin.readline().rstrip()


def solve():
    N = int(input())
    ans = int(N / 2 + 0.6)
    print(ans)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

print(math.ceil(a/2))

Submission status: Accepted

Solution code:
n = int(input())

x, y = divmod(n, 2)

print(x + y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
print(-1*(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())
# シンプルに割るだけ。
print((N + 1) // 2)

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

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())
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(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:
import math
n = int(input())
print(math.ceil(n / 2))

Submission status: Accepted

Solution code:
import math

n = int(input())

print(math.ceil(n / 2))

Submission status: Accepted

Solution code:
import math


def main():

    N = int(input())

    N = math.ceil(N / 2)

    print(N)


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = -(-n//2)
print(ans)

Submission status: Accepted

Solution code:
from decimal import Decimal, ROUND_HALF_UP

N = int(input())

result = Decimal(str(N/2)).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
print(result)

Submission status: Accepted

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

main()

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

print(-(-page // 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())
a = (n+1)/2
print(int(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

N = int(N)

ans = (N+1) // 2


print(ans)

Submission status: Accepted

Solution code:
N = input()

N = int(N)

ans = (N+1)//2


print(ans)

Submission status: Accepted

Solution code:
N = int(input())

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

r = n // 2
a = n % 2
print(r + a)

Submission status: Accepted

Solution code:
n = int(input())
min = 0

if n%2 == 0:
  min = n/2
else:
  min = n//2 + 1

print(int(min))

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((N+1) // 2)

Submission status: Accepted

Solution code:
import math

a=int(input())

print(math.ceil(a/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

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 ==0:
  print(int(N/2))
else:
  print(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:
def resolve():
    n = int(input())

    ans = n // 2 + n % 2
    print(ans)
resolve()

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
print((int)(math.ceil((int)(input())/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//2 if N%2 == 0 else N//2 +1)

Submission status: Accepted

Solution code:
N = int(input())

ans = N//2 + N % 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())

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

Submission status: Accepted

Solution code:
#graph implementation
import math
n=int(input())
print(math.ceil(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())
print((N-1)//2+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
n = int(input())
x = n / 2
y = n % 2
if y == 0:
  print(math.floor(x))
else:
  print(math.ceil(x))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# モジュールのインポート
import math


def get_input() -> int:
    """
    標準入力の取得

    Returns:\n
        int: 標準入力
    """
    N = int(input())

    return N


def main(N: int) -> None:
    """
    求解処理

    Args:
        N (int): ページ数
    """
    result = math.ceil(N/2)

    # 結果出力
    print(result)


if __name__ == "__main__":
    N = get_input()
    main(N)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# モジュールのインポート
import math
# 標準入力の取得
N = int(input())

# 求解処理
result = math.ceil(N/2)

# 結果出力
print(result)

Submission status: Accepted

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

ans = -(-N//2)

print(ans)

Submission status: Accepted

Solution code:
S = int(input())
q , mod = divmod(S , 2)
print(q+mod)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal, ROUND_HALF_UP

n = int(input())
print(Decimal(n/2).quantize(Decimal(0), rounding=ROUND_HALF_UP))

Submission status: Accepted

Solution code:
from sys import stdin
N = stdin.readline().rstrip()
N = int(N)
print(N//2 + N%2)

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
# coding: utf-8
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=int(input())

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

else:
    print((N+1)//2)

Submission status: Accepted

Solution code:
n = int(input())

ans = 0

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

else:
    ans = n//2 +1
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

ans = (n + 1) // 2
print(ans)

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
n=int(input())

x = int(n/2)

if n%2 == 1:
    ans = x + 1
else:
    ans = x

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:
def main():
    N = int(input())
    print(int((N+1)/2))

main()

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:
# -*- coding: <encoding name> -*-

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = int(input())
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())
print(n//2) if n%2==0 else print(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:
N = int(input())
print( -(-N // 2))

Submission status: Accepted

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

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:
def main():
    N = int(input())
    print(N // 2) if N % 2 == 0 else print(N // 2 + 1)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

ans = n // 2
ans += 1 if n % 2 != 0 else 0

print(ans)

Submission status: Accepted

Solution code:
div, rem = divmod(int(input()), 2)
print(div + bool(rem))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

ans = n//2
ans += n%2

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
if N%2 ==0:
    print(N//2)
elif N%2 != 0:
    print((N+1)//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:
N = int(input())

q, mod = divmod(N, 2)
if mod == 0:
    print(q)
else:
    print(q+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:
def A():
    n = int(input())
    print(-(-n//2))
A()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime
from collections import deque


#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets

#公約数の列挙
def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)

# 素因数分解
def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
	
def count_str(m):
	tmp={}
	for i in range(10):
		if i in tmp:
			tmp[i]=1
		else:
			tmp[i]+=1
	return tmp

def is_prime(n):
	if n==1: return True

	for i in range(2,int(math.sqrt(n))+1):
		if n%i==0:
			return False
	return True


n=input1()
print(n//2 + n%2)

Submission status: Accepted

Solution code:
# ABC157A

n = int(input())
print((n + 1) // 2)

Submission status: Accepted

Solution code:
import math
print(math.ceil(int(input())/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:
n = int(input())
print(n//2 + 1 if n%2 != 0 else n//2)

Submission status: Accepted

Solution code:

class abc_157:
    
    def __init__(self):
        pass
    
    def A(self):
       N=int(input())
       print(int(N/2)+(N%2))
    
    def B(self):
        A=[list(map(int,input().split())) for i in range(3)]
        N=int(input())
        
        B=[]
        for i in range(N):B.append(int(input()))
        
        
            
    def C(self):
        NM=list(map(int,input().split()))
        sc=[list(map(int,input().split())) for i in range(NM[1])]
        farst,second,third,full=[],[],[],[]
        division_list=[10**i for i in range(3)]
        ans=0
        
        for i in sc:
            if i[0]==1:farst.append(i)
            elif i[0]==2:second.append(i)
            else :third.append(i)
        
        sort_func=lambda val:val[1]
        farst.sort(key=sort_func)
        second.sort(key=sort_func)
        third.sort(key=sort_func)
        
        if farst:ans+=(10**(3-farst[0][0]))*farst[0][1]
        if second:ans+=(10**(3-second[0][0]))*second[0][1]
        if third:ans+=(10**(3-third[0][0]))*third[0][1]
        
        if int(ans/division_list[NM[0]-1])!=0:print(ans)
        else:print("-1")
            
    def D(self):
        S=input()
        Q=int(input())
        Q_list=[list(input().split()) for i in range(Q)]
        
        d=deque()
        top=True
        end=False
        count_revers=0
        
        d.append(S)
        for i in Q_list:
            #Ti==1
            if int(i[0])==1:
                count_revers+=1
                if top==True:
                    top=False
                    end=True
                else:
                    top=True
                    end=False
            #Ti==2
            else:
                #Fi==1
                if int(i[1])==1 :
                    if top==True:d.appendleft(i[2])
                    else:d.append(i[2])
                #Fi==2
                else :
                    if top==True:d.append(i[2])
                    else:d.appendleft(i[2])
                
                
        ans = "".join(list(d)) if count_revers%2==0 else  "".join(list(d))[::-1]
        print(ans)
        
    def E(self):
        pass
    
    def F(self):
        pass
    
    
if __name__=='__main__':
    obj=abc_157()
    obj.A()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

ans=divmod(n,2)
A=ans[0]+ans[1]

print(A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
print((n+1) // 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 == 0:
    print(int(n/2))
else:
    print(int(n//2+1))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import math
S = int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
N = int(stdin.readline().rstrip())
if N%2==1:
    print(N//2+1)
else:
    print(N//2)

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) if N % 2 == 0 else int((N+1)/2))

Submission status: Accepted

Solution code:
num = int(input())

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    n = int(stdin.readline())
    print(n // 2) if n % 2 == 0 else print((n + 1) // 2)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

Solution code:
n=int(input())
result=n//2
if n%2==0:
    print(result)
else:
    print(result+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:
def ABC_157_A():
    N = int(input())

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

if __name__ == '__main__':

    ABC_157_A()

Submission status: Accepted

Solution code:
from math import ceil

N = int(input())

print(ceil(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())
N=N/2
print(math.ceil(N))

Submission status: Accepted

Solution code:
#! env/bin/local python3
# -*- coding: utf-8 -*-

n = int(input())

print(n // 2 + n % 2)

Submission status: Accepted

Solution code:
n = int(raw_input())
print max(1, (n+1)/2)

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools
n = int(input())
if n % 2 == 1:
    print(n//2+1)
else: print(n//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

pages = int(input())
print(math.ceil(pages/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())

A = N // 2
B = N % 2

print(A + B)

Submission status: Accepted

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


def main():
    N = int(input())
    print(N//2+1) if N % 2 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 = int(input())

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

Submission status: Accepted

Solution code:
import sys
#from collections import defaultdict, deque, Counter
#from bisect import bisect_left
#import heapq
#import math
#from itertools import groupby as gb
#from itertools import permutations as perm
#from itertools import combinations as comb
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

n = int(stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
#x,y,z = map(int, stdin.readline().rstrip().split())
#AB = [list(map(int, stdin.readline().rstrip().split())) for _ in range(n)]

print(n//2 + n%2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

n = int(n)
if(n==2):
  print(1)
elif(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(n//2+1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May  7 13:56:42 2020

@author: shinba
"""
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
val = int(input())

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

Submission status: Accepted

Solution code:
import sys
import math
from math import ceil

input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
n = int(input())

p = n//2 + n%2
print(p)

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(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())
A = N / 2
A = int(A)
B = (N + 1) / 2
B = int(B)
if N % 2 == 0:
  print(A)
else:
  print(B)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Duplex Printing

from math import ceil
print(ceil(int(input()) / 2))

Submission status: Accepted

Solution code:
import math
n = int(input())
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)

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  # '123' -> 123
def Is(): return map(int, input().split())  # '123 456' -> 123, 456
def LI(): return list(map(int, input().split()))  # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split()))  # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input())  # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

n = I()
print(ceil(n/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
print(max(N//2, (N+1)//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:
import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque 
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする

def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds

def main():
    mod = 10**9+7
    #w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

    N = int(input())
    #N, K = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
    if N%2!=0:
        print(N//2+1)
        exit()
    print(N//2)





if __name__ == "__main__":
    main()

Submission status: Accepted

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

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 n%2 == 0 else n//2+1
print(ans)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline    ####
int1 = lambda x: int(x) - 1
def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

INF = float('inf')

def solve():
    n = II()
    print((n + 1) // 2)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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