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

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

Solution (Python):

from math import ceil
def main():
    n = int(input())
    a = ceil(n/2)
    print("{0:.10f}".format(a/n))
main()

Solution (Python):
import numpy as np

N = int(input())

l = np.arange(1,N+1)

print(np.sum(l%2==1)/N)

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

Solution (Python):
import numpy as np
import math

N = float(input())

p = math.ceil(N/2)/N

print(p)

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

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

ans = -(- n // 2) / n
print(ans)

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

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

elif N==1:
    print(1)

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

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

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

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

print(len(list(filter(lambda i: i % 2 == 1, range(1, n + 1)))) / n)

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

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

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

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

Solution (Python):
a = int(input())
M = []
for i in range(a):
    if i % 2 ==0:
        M.append(i)
b = len(M)
print(b/a)

Solution (Python):

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

Solution (Python):
from fractions import Fraction as f
n = int(input())
odd = 0
for i in range(1,n+1):
  if i % 2 != 0:
    odd += 1
print(float(f(odd,n)))

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

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

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

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

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

if N % 2 == 0:
    n = N // 2
else:
    n = N // 2 + 1

print (n / N)

Solution (Python):
N = int(input())
div, mod = divmod(N, 2)
if mod != 0:
    div += 1
oddness = div / N
print(oddness)

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

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

Solution (Python):



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

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

oddcount = 0

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

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

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

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

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

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

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

print(count/n)

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

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

Solution (Python):
N=int(input())
if N%2==0:
    print(0.5)
else:
    print('{:.7g}'.format((N+1)/(2*N)))

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

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

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

Solution (Python):
import math

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):
N=int(input())
odd = N//2+(N%2)

print(odd/N)

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

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

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

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

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

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

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

Solution (Python):
n = int(input())
if n % 2==0:
    x = [int(i) for i in range(n-1,0,-2)]
else:
    x = [int(i) for i in range(n,0,-2)]
print(len(x)/n)

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

odds = int((n+1) / 2)

print(odds/n)

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

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

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

odds = [n for n in range(1, N+1) if n%2==1]

print(len(odds)/N)

Solution (Python):
import numpy as np
from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  
from heapq import heappush, heappop


N = int(input())

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

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

main()

Solution (Python):
a = int(input())
b = []
c = a
for i in range(a):
    if c % 2 != 0:
        b.append(c)
    c = c - 1
print(len(b) / a)

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

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

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())
l=list(range(1,N+1))

if N==1:
  print(1.0000000000)

elif N%2==0:
  print(0.5000000000)

else:
  m=l[0::2]
  
  print(len(m)/N)

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

odd = 0

for i in range(1, a+1):
    if i%2==1:
        odd += 1

print('{:.10f}'.format(odd/a))

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

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

print(0.5 if N%2 == 0 else ceil(N/2)/N)

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

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

Solution (Python):




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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

s=0
s_odd=0

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

print(s_odd/s)

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

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

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

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

print(ans/n)

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

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

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

if n & 1:
  print(((n//2)+1)/n)
else:
  print(0.5)

Solution (Python):
N = input()

oddnum = list(range(1, int(N)+1, 2))
print(len(oddnum)/int(N))

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

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

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

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

Solution (Python):
n = int(input())
print('{:.8f}'.format((n//2 + (n%2))/n))

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

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

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

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

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

Solution (Python):
import sys
input=sys.stdin.readline
N=int(input())
odd=0
for _ in range(1,N+1):
    if _%2==1:
        odd+=1
print(odd/N)

Solution (Python):
l = [i + 1 for i in range(int(input()))];print(len([i for i in l if i % 2 == 1]) / len(l))

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

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

print("{0:.10f}".format(b))

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

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

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

odd, eve = 0, 0

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

print(odd/n)

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

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

Solution (Python):
n = int(input())
odd = 0
for i in range(1,n+1):
    if i % 2 == 1:
        odd +=1
print(odd/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("{:.10f}".format(0.5))
else:
    print("{:.10f}".format((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())
t = 0
for i in range(N):
  if i%2 == 0:
    t += 1
print(t/N)

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

if n % 2 ==0:
    print("{:.10f}".format(1/2))
else:
    if n == 1:
        print("{:.10f}".format(1))
    else:
        print("{:.10f}".format((int(n/2)+1)/n))

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

def read_int(row):
    return int(row().rstrip())

S = read_int(row)
print((S - S//2)/S)

Solution (Python):

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

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

Solution (Python):
def solve(inp):
    N = int(inp.readline().strip())

    return str((int(N / 2) + (N % 2)) / N)


def test(s):
    from io import StringIO
    print(solve(StringIO(s)))


def main():
    import sys
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    
    main()

Solution (Python):
import math 

N = int(input())

if N == 1:
    print(1)
else:
    print(math.ceil((N/2)) /N)

Solution (Python):
N = int(input())
listx = []
for i in range(1, N+1):
    listx.append(i)

countodd = 0

for j in range(len(listx)):
    if listx[j] % 2 != 0:
        countodd += 1
print(countodd / len(listx))

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

print(x/n)

Solution (Python):

N = int(input())

cnt_odd = 0
cnt_even = 0

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

ans = cnt_odd / (N)
print(ans)

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

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

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

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

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

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

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

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

    else:
        ans = ((N-1)/2 + 1)/N
        print(ans)

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

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

Solution (Python):
import math

a = int(input())
b = math.ceil(a/2)
p = b/a
print(p)

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

u = [x for x in range(1, n+1) if x % 2 != 0]
x = len(u) / n

print(float(x))

Solution (Python):
import sys


n = int(input())
if isinstance(n,int) == False:
    print("Input value is not a type of int.")
    sys.exit()
elif n < 1 or 100 < n:
    print("Input value is not in this range [0,100].")
    sys.exit()
else:
    if n%2 == 0:
        a = float(1/2)
    else:
        a = float(((n+1)/2)/n)
    
    print(a)

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

print(a)

Solution (Python):
n=int(input())
if n%2==1:
    a = ("%.10f" % ((n//2+1)/n))
else:
    a = ("%.10f" % ((n // 2 ) / n))

print(a)

Solution (Python):

N=int(input())

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

Solution (Python):

N=int(input())

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
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 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 = float('inf')
mod = 10 ** 9 + 7

n = INT()
if n % 2 == 0:
  print(0.5)
if n % 2 != 0:
  a = n // 2
  b = n // 2 + 1
  print(b / n)

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

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

print(c/N)

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

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


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

per = float(count / N)

print(per)

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

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

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

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

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

Solution (Python):
N = int(input())
odd_num = len([x for x in range(1, N+1) if x % 2 == 1])
even_num = len([x for x in range(1, N+1) if x % 2 == 0])
print(odd_num / (odd_num+even_num))

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

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

Solution (Python):
n = int(input())
print(float(sum([1 if i%2==1 else 0 for i in range(1, n+1)]))/float(n))

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
from math import ceil

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())

sys.setrecursionlimit(10 ** 9)


def main():
    N = INT()
    print(ceil(N/2)/N)


if __name__ == '__main__':
    main()

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

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

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

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

print( ( a // 2 + a % 2 ) / a )

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

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

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

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

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

    odd = 0

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

    print(odd/n)

if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):
import itertools

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

    return 0
if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N = int(read())
print((N-(N // 2)) / N)

Solution (Python):


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

Solution (Python):



N = int(input())

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

print(odd/N)

Solution (Python):
t = int(input())
a = [i+1 for i in range(t)]
count = 0

for x in a:
	if x % 2 == 1:
		count += 1

print(float(count) / float(t))

Solution (Python):
import sys

line = sys.stdin.readline()
n = int(line)
if n == 1:
    print(1)
elif n % 2 == 0:
    print(0.5)
else:
    print(0.5 + (0.5 / n))

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

print(float((n//2+(n-n//2*2))/(n//2*2+(n-n//2*2))))

Solution (Python):
n = int(input())
l = list(range(1,n+1))

even = sum(x%2==0 for x in l)
odd = n - even

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

num = 0

for i in range(N):
    if i % 2 == 0:
        num += 1
prob = float(num / N)
print(prob)

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

odd = 0

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

print(odd / N)

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

Solution (Python):
import math
N = int(input())
num = math.ceil(N/2)
print(format(num/N,'.10f'))

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

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

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

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

Solution (Python):
N = int(input())
n2 = N % 2

if n2 == 0:
  print(float(N/2)/N)
else:
  n3 = (N-1)/2
  print(float((n3+1))/N)

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

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

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

Solution (Python):
N = int(input())
print("%.10f"%(((N+1)//2)/N))

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

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

Solution (Python):
import math

n = int(input())

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

Solution (Python):
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
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 / n


print(main())

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a=INT()
    print((round(a/2+0.1)/a))
if __name__ == '__main__':
    do()

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

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

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

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

s = sum([i % 2 != 0 for i in range(1, N+1)])
print(s / N)

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


if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
n=int(input())
print(-(-n//2)/n)

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

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

print(sum / n)

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

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

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

print((n-n//2)/n)

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

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

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

print(count/n)

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

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

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

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

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

if n % 2 == 0:
  a = n // 2
else:
  a = n // 2 + 1

print(a / n)

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6)
if sys.platform in (['ios','darwin','win32']):
	sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(input())
def MAP(): return [int(s) for s in input().split()]

def main():
	N = INT()
	total = N
	cnt = 0
	for i in range(1, N+1):
		if i%2: cnt += 1
	
	print(cnt/total)

if __name__ == '__main__':
	main()

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


 
if __name__ == '__main__':
	main()

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

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

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

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

Solution (Python):
N = int(input())
if N == 1:
  print('1.0000000')
elif N%2 == 0:
  print('0.5000000')
else:
  print((((N-1)/2)+1)/N)

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

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

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

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

Solution (Python):
a=float(input())
print(((a+1)//2)/a)

Solution (Python):
N = int(input())
S = (N+1)//2.0
print(S/N)

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

even = [0]
odd = [0]
for i in range(n-1):
    if i % 2 == 0:
        even.append(i)
    else:
        odd.append(i)

print(n if n == 1 else len(odd)/n)

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

x = 0
for i in range(1, N + 1, 2):
  x += 1
ans = x / N

print(ans)

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

print("{:.8f}".format(((a + 1) // 2) / a))

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

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

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

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

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

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

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

Solution (Python):

 
import math
import itertools
import sys
import copy
 


N = int(input())

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

Solution (Python):
N = input()
A = int(N)
arr = []
for i in range(1,A+1):
  if i%2 != 0:
    arr.append(i)
  else: continue
print(len(arr)/A)

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

Solution (Python):
import math


N = int(input())

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res

N=II()

print(((N+N%2)/2)/N)