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

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

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
n=int(input())

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:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


def solve(N: int):
    return N//2+N % 2


def main():

    sys.setrecursionlimit(10 ** 6)

    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(f'{solve(N)}')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
n=int(input())

s=n//2
a=n%2

if a==1:
  print(s+1)
else:
  print(s)

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#l = list(map(int, input().split()))

n = int(input())

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

Submission status: Accepted

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

# A - Duplex Printing /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# 高橋君は、全 Nページから成る書類を両面印刷します。両面印刷では、1 枚の紙に 2ページ分のデータを印刷することが出来ます。
# 最小で何枚の紙が必要か求めてください。

# 制約
#     Nは整数
#     1≤N≤100

# 入力
# 入力は以下の形式で標準入力から与えられる。
# N

# 出力
# 答えを出力せよ。

# 入力例 1
# 5

# 出力例 1
# 3

# 1枚目の紙に 1,2 ページ目のデータを印刷し、 2 枚目の紙に 3,4 ページ目のデータを印刷し、 
# 3 枚目の紙に 5 ページ目のデータを印刷すれば、 3枚の紙に全てのデータを印刷することが出来ます。

# 入力例 2
# 2

# 出力例 2
# 1

# 入力例 3
# 100

# 出力例 3
# 50


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    N = int(lines[0])
    # N, M = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    result = -(N//(-2))

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['5']
        lines_export = [3]
    if pattern == 2:
        lines_input = ['2']
        lines_export = [1]
    if pattern == 3:
        lines_input = ['100']
        lines_export = [50]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)

readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))

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

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    div, mod = divmod(n, 2)
    if mod != 0:
        print(div + 1)
    else:
        print(div)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def duplex_printing(all_pages):
    # 集計
    all_papers = (all_pages + 1) // 2
    # 戻り値
    return all_papers

# 入力
N = int(input())
# 関数処理
result = duplex_printing(N)
# 表示
print(result)

Submission status: Accepted

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

if not ( 1 <= N <= 100 ): sys.exit()

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

Submission status: Accepted

Solution code:
import sys
from math import ceil


def main():
    input = sys.stdin.buffer.readline
    n = int(input())
    print(ceil(n / 2))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
A = N + 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#Macで実行する時
import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
	sys.stdin = open(name)

from math import ceil

n = int(input())

print(ceil(n/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

if N&0b1:
    ans=N//2+1
else:
    ans=N//2

print(ans)

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

n=k()
print(math.ceil(n/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


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


main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

p = n % 2 + n // 2

print(p)

Submission status: Accepted

Solution code:
import sys
import math
input = sys.stdin.readline
n=int(input())
print(math.ceil(n/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(math.ceil(N/2))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = math.ceil(N / 2.0)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = -(-N//2)

print(ans)

Submission status: Accepted

Solution code:
n = int(input())

# (1, 1), (2, 1) (3, 2), (4, 2)
print((n+1) // 2)

Submission status: Accepted

Solution code:
import math

if __name__ == '__main__':

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

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

print(N//2 + N%2)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
a = 0
b = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

div, mod = divmod(n, 2)
print(div+mod)

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

Submission status: Accepted

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

else:
    print(N//2)

Submission status: Accepted

Solution code:
import math

N = int(input())

print(math.ceil(N / 2))

Submission status: Accepted

Solution code:
# A - Duplex Printing
N = int(input())
print((N+1)//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

n = int(input())

print((n + 1) // 2)

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

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N = int(readline())
    
    print((N+1) // 2)
    
    return


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())

amari=n%2

if amari==0:
    print(int(n/2))

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

Submission status: Accepted

Solution code:
import math

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

print(result)

Submission status: Accepted

Solution code:
print(int(input())+1>>1)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Template 1.0
import sys, re
from decimal import *
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor, trunc, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

n = INT()

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

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# hello worldと表示する
#float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

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

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
import math
print(math.ceil(I()/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 n//2+1)

Submission status: Accepted

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

Submission status: Accepted

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

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


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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

print(x)

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


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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = int(input())
print(n // 2 + n % 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

ans = N // 2

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

print(ans)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

import math

n = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import itertools
import functools
import math
from collections import Counter
from itertools import combinations


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 + 1 if N % 2 else 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(int(math.ceil(n/2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
from math import cos,sin,tan,sqrt
import cmath as cma
import copy as cp
import sys
import re
import bisect as bs
sys.setrecursionlimit(10**7)
EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf
MOD = 10**9 + 7

def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def adj(n): return [[] for _ in range(n)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = int(input())

import math

print(math.ceil(i/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())
ans = n // 2
if n % 2 != 0: ans += 1
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

print(n//2+n%2)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# 157 A

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

Submission status: Accepted

Solution code:
#x = [int(x) for x in input().split()]
x = int(input())
print(x//2+x%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:
i=int(input())
if i%2==0: print(i//2)
else: print(i//2+1)

Submission status: Accepted

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

Submission status: Accepted

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

import sys

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 sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)


def main():
    N = int(input().strip())
    return (N//2) + N % 2


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

Submission status: Accepted

Solution code:
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*n
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())
pages = 0
if n%2 == 1:
    pages += 1
pages += n//2
print(pages)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
result=N/2
if N%2 != 0:
    result+=0.5
print(int(result))

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

print(math.ceil(n/2))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

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

Submission status: Accepted

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

Submission status: Accepted

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

print(math.ceil(N/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print(-(-n//2))
#5
#2
#100

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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