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

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

n = INT()
print((n + 1) // 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(int(N/2))
  exit()
print(N//2 + 1)

Submission status: Accepted

Solution code:
doc = int(input(''))
if doc % 2 == 0 :
          print (int( doc / 2 ))
else :
    print (int(doc / 2 + 0.5 ))

Submission status: Accepted

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

answer = math.ceil(N / 2)

print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces
nl = lambda: list(map(int, stdin.readline().split()))

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

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A = int(sys.stdin.buffer.readline().rstrip())
    print(A//2 if A%2 == 0 else A//2 + 1)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(int(ans))

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    print((n + 1) // 2)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc157/tasks/abc157_a
# -*- coding: utf-8 -*-
N = int(input())
if N%2 !=0:
  N = N+1
print(N//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import math
n = int(input())
# X = list(map(int, input().split()))
# n, k = map(int, input().split())
# p = math.ceil(sum(X)/n)
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:
print((int(input()) + 1)//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

x = sys.stdin.readline()
x = int((int(x)+1)/2)
print(x)

sys.stdout.flush()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

n = int(input())

print(math.floor((n+1)/2))

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


# Solve
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
# coding: utf-8
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:
  a = (n//2)+(n%2)
  print(a)

Submission status: Accepted

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

N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    solve()

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

Submission status: Accepted

Solution code:
n =int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def main():
    line = sys.stdin.readline().rstrip('\n')
    N = int(line)
    if (N % 2 == 0):
        print(N/2)
    else:
         print((N/2) + 1)

main()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
# coding: utf-8
import math

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

Submission status: Accepted

Solution code:
import sys
import os
import math


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = int(sys.stdin.readline().rstrip())
    print(math.ceil(N/2))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
num = N // 2
re = N % 2

if re == 0:
  print(num)
else:
  num = num +1
  print(num)

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)

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

n = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())
answer = divmod(N, 2)

print(answer[0]+answer[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
N= int(input())
q=N

q, mod = divmod(q, 2)

if mod==0:
    print(q)
else:
    print(q+1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = input()

ans = -(-int(N) // 2)

print(ans)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

while N > 2*count:
	count += 1

print(int(count))

Submission status: Accepted

Solution code:
# import math
# import bisect
# import heapq
# from collections import deque
# import numpy as np

# n, m = map(int, input().split())
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    N = int(input())
    print((N//2) + (N&1))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

x = int(input())

print(math.ceil(x/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 == 0) and (n // 2)) or (n // 2 + 1))

Submission status: Accepted

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

print(q+mod)

Submission status: Accepted

Solution code:
n = int(input())

page = n // 2
page += n % 2

print(page)

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n = I()

    return (n+1) // 2


print(main())

Submission status: Accepted

Solution code:
import math
import sys

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

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

Submission status: Accepted

Solution code:
N = int(input())

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

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

Submission status: Accepted

Solution code:
n = int(input())

ans = (n + 1) // 2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

ans = int(N) // 2 + int(N) % 2

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
n=int(N//2)
if N%2==0:
    print(n)
else:
    print(n+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:
a = list(map(int,input().split()))
b=a[0]
print((b+1)//2)

Submission status: Accepted

Solution code:
# A - Duplex Printing
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:
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    s = int(input().rstrip('\n'))
    print((s + 2 - 1) // 2)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(solve())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	N = int(input())
	if N % 2 == 1:
		ans = (N-1)/2 + 1
	else:
		ans = N/2
	print(int(ans))

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    a = N // 2
    b = N % 2
    print(a + b)
if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np


def main():
    n = int(input())
    print(int(np.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:
import math
N = int(input())
col = math.floor(N / 2)
judge = N % 2
if judge ==0:
  print(col)
else:
  col += 1
  print(col)

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

if b is 1:
    a = a + 1
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import unittest


class TestA(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think(3), 2)

    def test_2(self):
        self.assertEqual(think(2), 1)

    def test_3(self):
        self.assertEqual(think(100), 50)


def solve():
    n = read()
    result = think(n)
    write(result)


def read():
    return read_int(1)[0]


def read_int(n):
    return read_type(int, n, sep=' ')


def read_float(n):
    return read_type(float, n, sep=' ')


def read_type(t, n, sep):
    return list(map(lambda x: t(x), read_line().split(sep)))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(n):
    return n // 2 if n % 2 == 0 else n // 2 + 1


def write(result):
    print(result)


if __name__ == '__main__':
    # unittest.main()
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

q, mod = divmod(N, 2)
ans = q+mod

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
  
n = I()

print(n // 2 + n % 2)

Submission status: Accepted

Solution code:

import collections
import math


class Solution:
    def solve(self, N):
        return math.ceil(N/2)


sol = Solution()

n = int(input().strip())
print(sol.solve(n))

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:
import sys
def input(): return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10 ** 7)

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

N = int(input());

print(ceil(N / 2))

Submission status: Accepted

Solution code:
import os

n = int(input())

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

Submission status: Accepted

Solution code:
import os

n = int(input())

if 1 <= n and n <= 100 :
    if n % 2 == 0 :
        page = int(n/2)
    elif n % 2 == 1 :
        page = int(n/2) + 1
    print(int(page))

Submission status: Accepted

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

ans = N // 2

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(answer)

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

Solution code:
# coding: utf-8

input = raw_input()
n = int(input)

print -(-n // 2)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if a % 2 == 0:
    print(b)
else:
    print(c)

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 sys


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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