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

Submission status: Accepted

Solution code:
#A

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os

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())
l=n//2
if n%2==0:
  print(str(l))

else:
  print(str(l+1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]

n = I()
print(ceil(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:
a=int(input());print(a//2+a%2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)


############ ---- Input Functions ---- ############
def in_int():
    return (int(input()))


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


def in_str():
    s = input()
    return (list(s[:len(s) - 1]))


def in_ints():
    return (map(int, input().split()))


n = in_int()

print((n+1)//2)

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

ans = math.ceil(n / 2)

print(ans)

Submission status: Accepted

Solution code:
n = int(input())

div = n//2
rest = n%2

ans = div + rest

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if x % 2 == 1:
    num = num + 1
else:
    num
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:
#!/usr/bin/env python3

import math
N = int(input())

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

Submission status: Accepted

Solution code:
import math

N = int(input())

number_of_pages = math.ceil(N / 2)

print(number_of_pages)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
c,d=divmod(n,2)
if d != 0:
  c+=1

print(c)

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

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

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n = int(readline())
    print((n + 2 - 1) // 2)


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

Submission status: Accepted

Solution code:
#-Duplex Printing
import math
number = int(input())
print (math.ceil(number/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC157A
def main():
    import sys
    N = int(sys.stdin.readline())
    print(N//2 + N%2)


if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

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

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):
    ans=ans+1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
answer = divmod(int(input()), 2)
print(answer[0]+answer[1])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
p = int(input())

print((p+1) // 2)

Submission status: Accepted

Solution code:
p = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = int(input())
ryou = i//2
kata = i%2
print(ryou+kata)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# N = int(input("1以上100以下の数字を入れてください:"))
N = int(input())
if N % 2 ==0:
    print(N // 2) #N // 2にすると小数点以下が切り捨て（整数部分だけ表示される）→つまりint（整数）
else:
    print(N // 2 +1) #elseのインデントはifと揃える
"""
N % 2は割ったときの余りを見る
"""

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())
q = n // 2
r = n % 2
print(q+r)

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

page = (N - N%2)/2 + N%2

print(int(page))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

if N%2 == 1:
 ans = N//2 +1
else:
 ans = N//2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def solve(N: int):
    print((N-1)//2+1)
    return


# 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
    solve(N)

if __name__ == '__main__':
    main()

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

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

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:
n = int(input())
ans = -(-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())
 
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:
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())
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 + N %2)

Submission status: Accepted

Solution code:

n = int(input())

s= n//(2)
sn = n%(2)

print(s+sn)

Submission status: Accepted

Solution code:
# ABC 157: A – Duplex Printing
import math
print(math.ceil(int(input()) / 2))

Submission status: Accepted

Solution code:
def q1():
    """ A - Duplex Printing
    高橋君は、全Nページから成る書類を両面印刷します。
    両面印刷では、1枚の紙に2ページ分のデータを印刷することが出来ます。
    最小で何枚の紙が必要か求めてください。
    """
    N = int(input())
    d,m = divmod(N,2)
    print(d+m)


if __name__ == '__main__':
    q1()

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:
#!/usr/bin/env python3
#atcoder-tools test
print(int(input())+1>>1)

Submission status: Accepted

Solution code:
import math

S = int(input())

if S %2 ==0:
    a =S/2
else:
    a =math.ceil(S/2)
    
print(int(a))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  n = int(input())
  print(n//2 + n%2)
  
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
N = int(input())
a, b = divmod(N, 2)
print(a+b)

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

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:
#Duplex Printing
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 is 0:
    print(int(n / 2))
else:
    print(int(n / 2) + 1)

Submission status: Accepted

Solution code:
import sys
N = int(sys.stdin.readline())
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())
ans = N // 2
ans_amari = N % 2
print(ans + ans_amari)

Submission status: Accepted

Solution code:
import sys

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

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

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

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

print(-(-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 * 0.5))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

x = n // 2
y = n % 2

print(x+y)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())

paper = (n // 2) + (n % 2)

print(paper)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#--------------------------------------------
#ライブラリ呼び出し
import sys
import math
#from math import sqrt
#--------------------------------------------
N = int(input())
print(math.ceil(N/2))

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from decimal import Decimal, ROUND_HALF_UP

N = Decimal(input())
sheets = N / 2
result = sheets.quantize(Decimal('0'), rounding=ROUND_HALF_UP)

print(result)

Submission status: Accepted

Solution code:
import math
N = int(input())
sheets = N / 2

print(math.ceil(sheets))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Duplex Printing

N = int(input())

print((N+(2-1))//2)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
n = int(input())

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:
# problem A

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

Submission status: Accepted

Solution code:
n=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

p = n // 2 

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

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:
n = int(input())
print("{}".format(-(-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())

s = n//2
t = n% 2

if t ==1:
    print(s+1)
if t ==0:
    print(s)

Submission status: Accepted

Solution code:
N = int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())
count = int(a / 2)
if a % 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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc157/tasks/abc157_a

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

Submission status: Accepted

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

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:
from math import ceil
print(ceil(int(input()) / 2.0 ))

Submission status: Accepted

Solution code:
print(int(int(input().rstrip()) / 2+.9))

Submission status: Accepted

Solution code:
def main():

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


if __name__ == '__main__':
    print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

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:
import math
N = float(input())

print(math.ceil(N/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = (N + 1) // 2

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

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

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:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

print(N // 2 + N % 2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
ans = (N+1)//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//2 + n % 2)

Submission status: Accepted

Solution code:
n = int(input())
x, y = divmod(n, 2)
ans = x + y
print(ans)

Submission status: Accepted

Solution code:
import sys
import math
from io import StringIO
import unittest

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

Submission status: Accepted

Solution code:
def cal(a):
    ans=a/2
    if n%2==0:
        b=int(ans)
        return b
    else :
        ans+=0.5
        b=int(ans)
        return b

n=int(input())
print(cal(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:
n = int(input())
print(n // 2 + n % 2)

Submission status: Accepted

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

Submission status: Accepted

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

print(math.ceil(N/2))

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

Submission status: Accepted

Solution code:
user_input = int(input())
if 1 <= user_input <= 100:
    check = user_input % 2
    if check == 0:
        print(user_input//2)
    else:
        print(user_input//2 + check)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
#coding:utf-8

n = int(input())
ans = n // 2 + n % 2
print("{}".format(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

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


def main():
    n = int(input().strip())
    print(round((n + 0.5) / 2))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

n = int(input())

print((n + 1) // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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