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

if num % 2 == 1:
    num = num // 2 + 1
else:
    num = num // 2

print(num)

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())
import math
print(math.ceil(n/2.0))

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())
def main(n):
  return n // 2 + n % 2
print(main(n))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    r = input()
    r = int(r)
    result = int(r/2+0.5)
    print(result)

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

n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

ans = a // 2

if a % 2 == 1:
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

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

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read 
inp = sys.stdin.buffer.readline
def inpS(): return inp().rstrip().decode()
readlines = sys.stdin.buffer.readlines 

N = int(inp())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
if N.isdigit() and int(N) >= 1 and  int(N) <= 100:
  if int(N) % 2 == 0:
    ans = int(N) / 2
  else:
    ans = (int(N) - 1) / 2 + 1
  print(int(ans))
else:
  print('error')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

n = int(sys.stdin.readline())
rem = n%2
print(n//2 + rem)

Submission status: Accepted

Solution code:
# coding: utf-8

n = input()

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

Submission status: Accepted

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

pages = int(input())
mod = pages % 2

if mod == 1:
    papers = pages // 2 + 1
else:
    papers = pages // 2

print(papers)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def main():
    # write codes here
    N = I()
    print(math.ceil(N/2))
    return 0


# Main
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

result+=N//2

if N % 2==1:
    result+=1

print(result)

Submission status: Accepted

Solution code:
n = int(input())

if n %2 :
    print(n//2+1)
else:
    print(n//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:
from math import ceil
n = int(input())
page = int(ceil(n/2))
print(page)

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
if __name__ == '__main__':
    n = input()
    n = int(n)
    ans = math.ceil(n/2)
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

print(str(j))

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:
if __name__ == '__main__':
    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
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())
print(round((N/2)+0.01))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

def func(N):
    ans = math.floor(N / 2) + 1 if N % 2 else math.floor(N / 2)
    return ans
  
  
N = int(input())

print(func(N))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import sys
import numpy as np
import collections
from functools import cmp_to_key
import heapq

##  input functions for me
def rsa(sep = ''):
    if sep == '' :
        return input().split() 
    else: return input().split(sep)
def rip(sep = ''):
    if sep == '' :
        return map(int, input().split()) 
    else: return map(int, input().split(sep))
def ria(sep = ''): 
    return list(rip(sep))
def ri(): return int(input())
def rd(): return float(input())
def rs(): return input()
##
def main():
    n = ri()
    print((n + 1) // 2)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import math


def solve(N: int):
    return math.ceil(N/2)

# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    print(solve(N))

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
N = int(input())
a=N/2
b=N%2
if b == 0:
  print(math.floor(a))
elif b == 1:
  print(math.floor(a+0.5))
else:
  print("error")

Submission status: Accepted

Solution code:
import math
 
N = int(input())
 
M = math.floor(N / 2)
if N % 2 != 0:
    M = M+1
print(M)

Submission status: Accepted

Solution code:
# coding: utf-8
import re
import math
import itertools
from copy import deepcopy
import fractions
import random
from functools import lru_cache
from heapq import heappop,heappush
import time
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def fac_list(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s

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

Submission status: Accepted

Solution code:
N = int(input())
r=N//2
q=N%2

print(str(r+q))

Submission status: Accepted

Solution code:
def inp():
    return input()
def iinp():
    return int(input())
def inps():
    return input().split()
def miinps():
    return map(int,input().split())
def linps():
    return list(input().split())
def lmiinps():
    return list(map(int,input().split()))
def lmiinpsf(n):
    return [list(map(int,input().split()))for _ in range(n)]

n = iinp()
a = n // 2

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

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 == 0:
  print(ans)
else:
  print(ans+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:
import math
N = int(input())
needs = math.ceil(N/2)
print(needs)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(y)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
M = N // 2
A = (N / 2) - M
if A == 0:
    A = 0
else:
    A = 1
T = M + A
print(T)

Submission status: Accepted

Solution code:
N = int(input())

print((N+1) // 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

if int(x) % 2:
    print(int(int(x)/2+0.5))
else:
    print(int(int(x)/2))

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    n = int(input())
    print(n//2+n%2)

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

Submission status: Accepted

Solution code:
# cook your dish here
import math
x = int(input())
print (math.ceil(x/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil, floor

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


# main
if __name__ == '__main__':
    n = int(input())
    solve(n)

Submission status: Accepted

Solution code:
n=int(input())

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

Submission status: Accepted

Solution code:
page = int(input())

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

Submission status: Accepted

Solution code:
a = int(input())

b = int(a/2)

if b < a / 2:
  b = b + 1
 
print(b)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    n = int(input())
    ans = n // 2

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

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

if __name__ == '__main__':
  run()

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

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

Submission status: Accepted

Solution code:
N = int(input())
if N % 2 == 0:
  print(int(N/2))
else:
  print(int(1+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 permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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

def main():
    n = INT()
    print((n+1)//2)


if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

num = N//2
a = N%2

print(num+a)

Submission status: Accepted

Solution code:
import sys
from math import *
from collections import deque, Counter, defaultdict
from fractions import gcd
input = lambda: sys.stdin.readline().rstrip()

def eprint(s):
    sys.stderr.write('DEBUG: {}'.format(s))
    return

def main():
    n = int(input())
    print(ceil(n/2))
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Tue Mar  3 19:08:31 2020

@author: Kanaru Sato
"""

N = int(input())

ans = N//2 + N%2

print(ans)

Submission status: Accepted

Solution code:
import math

pages = input()
count = int(pages)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
def main():
    readline=stdin.readline
    N=int(readline())
    if N%2==0:
        print(N//2)
    else:
        print(N//2+1)
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
def solve(string):
    return str((int(string) + 1) // 2)


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Submission status: Accepted

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

num = - (-a//2)

print(num)

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from bisect import bisect_left
import sys,math,itertools,pprint,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
n = int(input())

print(n//2 + n%2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
n = int(input())

count = 0
while n> 0:
    count += 1
    n -= 2
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# from fractions import gcd
# mod = 10 ** 9 + 7
# N = int(input())
# a = list(map(int,input().split()))
# a,b,c = map(int,input().split())
# ans = [0] * N
# math.ceilで切り上げ
# dp = [[0] * 4 for i in range(3)] #2次元配列初期化
# dp = [[[0] * 2 for i in range(3)] for j in range(5)]
# (ord('A'))でASCII出力 Aは65
import math
import statistics
import string


def intinput():
    return int(input())
def listintinput():
    return list(map(int, input().split()))
def splitintinput():
    return map(int, input().split())
def factorialsurplus(x, y, z):  # xからyまでの階乗をzで割ったあまりを求める
    ret = 1
    for i in range(x, y + 1):
        ret = (ret * i) % z
    return (ret)
def isprime(x):
    if x == 1:
        return False
    if x == 2:
        return True
    sq = int(math.sqrt(x))
    for i in range(2,sq+1):
        if x % i == 0:
            return False
    return True
def hcfnaive(a,b):#最大公約数 math.gcdが使えない時の手段として入れとく。pythonが更新されたらいらなくなるはず
    if(b==0):
        return a
    else:
        return hcfnaive(b,a%b)

N = intinput()
print(math.ceil(N/2))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
from math import ceil

if __name__ == '__main__':
    n = 0
    while n < 1 or n > 100:
        n = int(input())
        if n < 1 or n > 100:
            print("Range of N must be 100 from 1.")

    print(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:
print(int(int(input())/2+0.5))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import math
# from itertools import permutations as permus
# from fractions import gcd

# import numpy as np
# import scipy as scp

# 入力の受け取り
n = int(input())

a,b = divmod(n,2)
ans = a + b
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())

print(sum(divmod(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())

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

Submission status: Accepted

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

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=int(n/2)

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(N: int):
    from math import ceil
    print(ceil(N/2))
    return



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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC 157A
n = int(input())
a = n // 2
if n%2 == 0:
    print(a)
else:
    print(a+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    info = int(input())
    flag = info / 2
    if flag.is_integer():
        result = int(flag)
    else:
        result = int(flag) + 1
    
    print(result)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

N = int(input())

print((N + 1) // 2)

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(eval("0--"+input()+"//2"))

Submission status: Accepted

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

def main():
    n = int(input())
    print(int(n//2 + n%2))

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


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


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    N = read_int()
    res = N // 2
    if N % 2 != 0:
      res += 1
    print(res)


main()

Submission status: Accepted

Solution code:
n=int(input())
print((n+n%2)//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 = list(map(int,input().split(' ')))

print((N+1)//2)