Problem:
 Score : 100 points    Problem Statement Given is an integer N .  Takahashi chooses an integer a from the positive integers not greater than N with equal probability.  Find the probability that a is odd.      Constraints  1 \leq N \leq 100         Input Input is given from Standard Input in the following format:  N       Output Print the probability that a is odd.
Your output will be considered correct when its absolute or relative error from the judge's output is at most 10^{-6} .        Sample Input 1 4      Sample Output 1 0.5000000000  There are four positive integers not greater than 4 : 1 , 2 , 3 , and 4 . Among them, we have two odd numbers: 1 and 3 . Thus, the answer is \frac{2}{4} = 0.5 .       Sample Input 2 5      Sample Output 2 0.6000000000       Sample Input 3 1      Sample Output 3 1.0000000000

Solution (Python):

from __future__ import division
def main():
    N = int(input())
    print(1 - ((N // 2) / N))


if __name__ == '__main__':
    main()

Solution (Python):

N = int(input())

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

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

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

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

Solution (Python):
n = int(input())

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

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

Solution (Python):
N = int(input())
print(1 - float((N//2)/N))

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

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())

def main():
    N = ii()
    print(((N+1)//2)/N)


main()

Solution (Python):
n=int(input())

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

Solution (Python):
n = int(input())

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

Solution (Python):
N = int(input())
kicount = 0
gucount = 0
for i in range(1, N + 1):
    if i % 2 == 0:
        gucount += 1
    else:
        kicount += 1

print(kicount / (gucount + kicount))

Solution (Python):
A=int(input())
if A%2==0:
    print(0.5)
elif A==1:
    print(1)
else:
    print((A-A//2)/A)

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

if N%2==0:
  ans = 0.5
else:
  odds = (N-1)//2 + 1
  ans = odds / N
print(ans)

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

Solution (Python):
N = int(input())
cnt = 0
for i in range(1,N+1):
    if i % 2 == 1:
        cnt += 1
print(cnt / N )

Solution (Python):
words = lambda t : list(map(t, input().split()))
n = int(input())

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

Solution (Python):
import math

def main():
    N = int(input())

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



if __name__ == "__main__":
    main()

Solution (Python):
num = int(input())

count = 0
for i in range(num):
    if i % 2 == 0:
        count = count + 1

print(count / num)

Solution (Python):
n = int(input())

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

Solution (Python):
import sys
sys.setrecursionlimit(100000)

def ins(): return input().split()
def ii(): return int(input())
def iil(): return list(map(int,ins()))
def lin(): return list(input())
def iin(): return map(int,ins())

a = ii()
print(((a+1)//2)/a)

Solution (Python):
a = int(input())

if a%2==0:
    print(0.5)
elif a==1:
    print(1.0)
else:
    print((a//2+1)/a)

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

i = 1
count = 0
while i <= N:
  if i % 2 ==0:
    i+=1
  else:
    count += 1
    i += 1
    
print(count/N)

Solution (Python):
def answer():
    n = int(input())
    c = n//2
    b = n - c
    print(b/n)


if __name__ == '__main__':
    answer()

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

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

Solution (Python):
A = int(input())

ans = 0

odd = 0
even = 0

for n in range(A, 0, -1):
    
    if n % 2 == 0:
        even += 1
    else:
        odd += 1

print(odd/(even+odd))

Solution (Python):
import sys

input = sys.stdin.readline


class AtCoder:
    def main(self):
        N = int(input())

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



if __name__ == '__main__':
    AtCoder().main()

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

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

Solution (Python):
N = int(input())
cnt = 0
for i in range(1, N + 1):
    if i % 2 != 0:
        cnt += 1

print(cnt / N)

Solution (Python):
n = int(input())

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

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

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

Solution (Python):

import sys


def solve(N: int):
    count = 0
    for i in range(1, N+1):
        if i  % 2 != 0:
            count += 1
    print(count / N)
    return



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

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())

count = 0
for i in range(1, n+1):
    if i % 2 != 0:
        count += 1

print(count / n)

Solution (Python):
import sys
input = sys.stdin.readline

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

if __name__ == '__main__': main()

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

Solution (Python):
n = int(input())

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

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

Solution (Python):
n = int(input())

if n == 1:
  print("1")

elif n%2 == 0:
  print("0.500000000")

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

Solution (Python):
N=int(input())
s = 0
for i in range(1, N+1):
  if i % 2 != 0:
    s += 1
res = s / N
print(res)

Solution (Python):
n = int(input())

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

Solution (Python):


n = int(input())

ki = (n+1) // 2

guu = n // 2

ans = ki / n

print(ans)

Solution (Python):
n = int(input())
k = n//2
z = n-k
 
print(z/n)

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

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

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

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

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

print(ans)

Solution (Python):
a = int(input())
g = 0
k = 0
for i in range(1,a+1):
    if i %2== 1:
        k +=1
    else:
        g+=1


print(k/a)

Solution (Python):
from math import ceil

N = int(input())
num_odds = ceil(N / 2)
print(num_odds / N)

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

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

Solution (Python):
N = int(input().strip())
if N % 2 == 0:
    print(0.5)
else:
    print((N//2 + 1)/ N)

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

Solution (Python):


import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def MI() : return map(int, input().split())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

N = I()

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

Solution (Python):
N=int(input())
A=list(range(1,N+1))
B=list(range(1,N+1,2))
print(len(B)/len(A))

Solution (Python):



def solve(N):
    if N % 2 == 0:
        return 0.5
    else:
        return (N // 2 + 1) / N


if __name__ == '__main__':
    N = int(input())

    ans = solve(N)

    print(ans)

Solution (Python):
n = int(input())

kisuu = 0
for i in range(1, n+1):
    if i%2 == 1:
        kisuu += 1

print(kisuu / n)

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

odd = 0
even = 0
for n in range(1, N+1):
    if n % 2 == 0:
        even += 1
    else:
        odd += 1
print(odd/(odd+even))

Solution (Python):
n = int(input())

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

Solution (Python):
n=int(input())

cn=0
for i in range(1,n+1):
    if i%2==1:
        cn+=1

print(cn/n)

Solution (Python):

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

Solution (Python):


import sys

n= int(sys.stdin.readline())
o= n - n//2

print( float( o ) / n )

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

Solution (Python):
n = int(input())

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

Solution (Python):
n = int(input())

answer = 0

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

print(answer)

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

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

Solution (Python):
n = int(input())
j = 0
for i in range(1,n+1):
    if i % 2 == 1:
        j += 1
        
print(j/n)

Solution (Python):
from sys import stdin

def main():
    input = lambda: stdin.readline()[:-1]
    N = int(input())

    odd = 0
    for i in range(N, 0, -1):
        odd += i % 2
    print(odd / N)

main()

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

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

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

Solution (Python):
def read():
    N = int(input().strip())
    return N

def solve(N):
    even = N // 2
    odds = N - even
    return 1.0 * odds / N

if __name__ == '__main__':
    inputs = read()
    print("%.8f" % solve(inputs))

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

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

Solution (Python):


N = int(input())

cnt = 0
for i in range(1,N+1):
    if (i % 2 != 0):
        cnt += 1
print(cnt / N)

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

ki = N // 2 + N % 2

print(ki / N)

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

Solution (Python):
import sys
input=sys.stdin.readline

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : map(int, stdin.readline().split())

def main():
  n = ni()

  odd = 1 if n%2 == 1 else 0
  for i in range(1, n+1):
    if i%2 == 0:
      odd += 1
  print(odd/n)

main()

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

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

Solution (Python):
n = int(input())

cnt = 0
for i in range(1, n+1):
    cnt += i % 2 == 1

print(cnt / n)

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

Solution (Python):
n = int(input())

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

Solution (Python):
n = int(input())
total = 0
for i in range(1, n+1):
    if i % 2 == 1:
        total += 1
print(total/n)

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

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

Solution (Python):
n = int(input())

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

Solution (Python):
n = int(input())

count = 0
for i in range(n+1):
  if (i % 2) == 1:
    count += 1
print(count/n)

Solution (Python):


n = int(input())
ans = 0
for i in range(1, n + 1):
    if i % 2 == 1:
        ans += 1


print(ans/n)

Solution (Python):
n = int(input())
m = 0
for i in range(n+1):
  if i % 2 == 1 :
    m+= 1

print(m/n)

Solution (Python):
n = int(input())

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

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

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

Solution (Python):

n = int(input())

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

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

Solution (Python):
n=int(input())

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

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

Solution (Python):


a = int(input())
odd = (a // 2) + (a % 2)

print(odd / a)

Solution (Python):
n = int(input())

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

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

count = 0
for i in range(1, N + 1):
    if i % 2 == 1:
        count += 1

print(count/N)

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

Solution (Python):
n=int(input())
odd = 0
evn = 0
for i in range(1,n+1):
    if i%2==1:
        odd+=1
        
print(odd/n)

Solution (Python):
def getlist():
	return list(map(int, input().split()))

N = int(input())
if N % 2 == 0:
	print(0.5)
else:
	print((N - (N // 2)) / N)

Solution (Python):
n=int(input())
nn=(n+1)//2
print(float(nn/n))

Solution (Python):



def ri():
    return int(input())

def rl():
    return list(input().split())

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

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


if __name__ == '__main__':
    main()

Solution (Python):
import math

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

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

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

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

Solution (Python):
n = int(input())
li = []
for i in range(1,n+1):
    if i%2 != 0:
        li.append(i)
print(len(li)/n)

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

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

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(0.5)
else:
    print(((n // 2) + 1.0) / n)

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

Solution (Python):
N = int(raw_input())
num_odd = N/2 + N%2

print 1.0*num_odd/N

Solution (Python):
N = float(input())

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

Solution (Python):
n = int(input())

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

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

Solution (Python):
n = int(input())
odd = 0
for i in range(n):
    if (i + 1) % 2:
        odd += 1
print(odd / n)

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

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

    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

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

Solution (Python):



import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Solution (Python):

N = int(input())

count = 0

for i in range(N+1):
    if(i % 2 == 1):
        count += 1

print(count/N)

Solution (Python):






import math
import statistics
import numpy as np

n = int(input())
print('{:.8f}'.format((n - n // 2) / n))

Solution (Python):
n = int(input())

if n % 2 == 0:
    print("%.7lf" % 0.5)
else:
    print("%.7lf" % ((n // 2 + 1) / n))

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

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

Solution (Python):
n = int(input())
k=0
for i in range(1,n+1):
  if i%2!=0:
    k+=1
print(k/n)

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

Solution (Python):
n=int(input())

cnt=0

for i in range(1,n+1):
    if i%2!=0:
        cnt+=1
print(cnt/n)

Solution (Python):
n=int(input())

odd=[]
for i in range(1,n+1):
  if i%2==1:
    odd.append(i)
print(len(odd)/n)

Solution (Python):
import math

n = int(input())

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

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

n = onem()


k = 0
kk = 0

for i in range(1,n+1):
    if i % 2 != 0:
        k += 1
    kk += 1
print(k/kk)

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

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

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

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

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

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

Solution (Python):
n=int(input())

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

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

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

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

Solution (Python):
N = int(input())
odds = range(1,N+1,2)
print(len(odds)/N)

Solution (Python):
n=int(input())
ans=0
for i in range(n):
  hoge=i+1
  if(hoge%2==1):
    ans+=1
print(ans/n)

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

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline

N = int(input()) 

o = N//2

ans = float(N-o)/N

print(ans)

Solution (Python):

n = int(input())
cnt = 0
for i in range(1, n + 1):
    if i % 2 == 1:
        cnt += 1
print(cnt / n)

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

Solution (Python):
n = int(input())
cnt = 0
for i in range(1, n + 1):
    if i % 2 == 1:
        cnt += 1.0
print(cnt / n)

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

x = N % 2

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