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: Wrong Answer

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
import queue
import copy
import bisect


def dfs(s, prev, pre):
  val[s] += Ope[s] + prev
  for i in G[s]:
    if(i == pre):
      continue
    dfs(i, val[s], s)

#X = str(input()).split()
#a = [int(x) for x in input().split()]
#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
N = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

print(n % 2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np

# input = sys.stdin.readline

n = int(input())

print(round(n))

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
import sys

N = int(sys.stdin.readline().strip())
print(N//2)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())

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

Submission status: Wrong Answer

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

print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
N = int(input())

print(N//2)

Submission status: Wrong Answer

Solution code:
N = int(input())

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

Submission status: Wrong Answer

Solution code:
print(round(float(input())/2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())

print(a//2 + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if n%2 == 0:
  print(n/2)
else:
  print(math.ceil(n/2))

Submission status: Wrong Answer

Solution code:
#N,K = map(int,input().split())
N=int(input())
if N%2==0:
    print(N/2)
else:
    print(N//2+1)

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
n=int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
n = int(input())

print(int(n/2))

Submission status: Wrong Answer

Solution code:
import numpy as np

N = int(input())

print(np.ceil(N / 2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import math
import fractions
import itertools
from collections import deque
import copy
import bisect

MOD = 10 ** 9 + 7
INF = 10 ** 18 + 7
input = lambda: sys.stdin.readline().strip()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
m = int(input())

# n = list(map(int, input().split()))
print(m//2)

Submission status: Wrong Answer

Solution code:
N = int(input())

print(-(-N)//2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

print(N//2)

Submission status: Wrong Answer

Solution code:
N=int(input())
#xs = [int(x) for x in input().split()]




print(N//2)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

print(N / 2 if not N % 2 else N // 2+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def sep():
    return map(int,input().strip().split(" "))
def lis():
    return list(sep())

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

Submission status: Accepted

Solution code:
d = int(input())

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

Submission status: Accepted

Solution code:
N=int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

div = -(-n // 2)

print(div)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

a = int(input())

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

Submission status: Accepted

Solution code:
# 整数の入力
N = int(input())

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

Submission status: Accepted

Solution code:
import sys
from math import ceil as C, floor as F, sqrt, gcd as G
from collections import defaultdict as D, Counter as CNT
from functools import reduce as R
import heapq as HQ

class Heap:
  def __init__(self, data, reverse=False):
    self.reverse = -1 if reverse else 1
    self.data = [self.reverse * d for d in data]
    HQ.heapify(self.data)
  def push(self, x): return HQ.heappush(self.data, self.reverse * x)
  def pop(self): return self.reverse * HQ.heappop(self.data) 

ALP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
alp = 'abcdefghijklmnopqrstuvwxyz'
def _X(): return sys.stdin.readline().rstrip().split(' ')
def _S(ss): return tuple(ss) if len(ss) > 1 else ss[0]
def S(): return _S(_X())
def Ss(): return list(S())
def _I(ss): return tuple([int(s) for s in ss]) if isinstance(ss, tuple) else int(ss)
def I(): return _I(S())
def _Is(ss): return list(ss) if isinstance(ss, tuple) else [ss]
def Is(): return _Is(I())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

n = int(input())

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

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

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import math
s=int(input())
# b=input()
# c=[]
# for i in range(b):
#     c.append(a[i])
#a = list(map(int,input().split()))
#b = list(map(int,input().split()))
print(math.ceil(s/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

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




if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

N = int(input())

print(math.ceil(N / 2))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())
ans = N//2 + (1 if N % 2 == 1 else 0)
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:
import sys
n = int(sys.stdin.readline().rstrip("\n"))
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:
n = int(input())
from math import ceil
print(ceil(n/2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
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:
# vim: fileencoding=utf-8


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

N = int(input())

page = int((N - 1 + 2) / 2)
print(page)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A
n=int(input())

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

Submission status: Accepted

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

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().rstrip())
r = (N + 1) / 2
print(int(r))

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

Submission status: Accepted

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

print(int(round(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())

print((N+1)//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC157-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:
def resolve():
    N = int(input())
    import math
    print(math.ceil(N/2))

if '__main__' == __name__:
    resolve()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC159
n = int(input())
x = n // 2
y = n % 2
print(x + y)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

print(n // 2 + n % 2)

Submission status: Accepted

Solution code:
m=int(input())

print(m//2+m%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:

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Duplex Printing
N = int(input())
ans = N // 2 + min(1, N % 2)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
N = int(sys.stdin.buffer.read())
print(-(-N // 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n = inp()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
n = int(input())
print(int(np.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 + 1) // 2)

Submission status: Accepted

Solution code:
N=input()

N=int(N)

q1, mod = divmod(N,2)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    N = int(input())
    print(ceil(N, 2))


def main():
    solve()


if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

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

import math

def main():

    N = int(input())

    ans = math.ceil(N / 2)

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())

print((n + 1) // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
x=int(input())
print(math.ceil(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:
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
# -*- coding: utf-8 -*-
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())

import math

print(math.ceil(N / 2))