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

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

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

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

Solution (Python):
import sys

input_line = input()
N = int(input_line.split(' ')[0])

buff = [i for i in range(1,N+1,1)]
print('{:.10f}'.format(len(buff[::2])/len(buff)))

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

if n % 2 == 0:
  v = 0.5
else:
  m = (n - 1) / 2
  v = (m + 1) / n
  
print("{}".format(v))

Solution (Python):
n = int(input())
a = [0]
a = [i for i in range(1,n+1)]
c = a[0::2]

print(float(len(c)/len(a)))

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


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

print(ans)

Solution (Python):
N = int(input())
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())
a = 0
for i in range(n):
    if (i+1)%2 != 0:
        a += 1
print(a/n)

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

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

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

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

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

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

Solution (Python):
N = int(input())
answer = 0.0
odd = 0
even = 0
for i in range(1,N+1):
    if i % 2 == 0:
        even += 1
    else:
        odd += 1
answer = odd / N
print("{:.6g}".format(answer))

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

Solution (Python):
try:
    n=int(input())
    even=n//2
    odd=n-even
    a=odd/n
    print('%.10f'%a)
except:
    pass

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

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

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

Solution (Python):
num_odd = lambda x: x/2 if x % 2 == 0 else x/2 + 1 
 
import fileinput
for line in fileinput.input():
    try:
        N = int(line.strip())
    except:
        continue
 
    print(1.0 * num_odd(N) / N)

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

Solution (Python):
N = int(input())
if N % 2 == 0:
  print(0.5)
else:
  a = N // 2 + 1
  print(a/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())
l = [i for i in range(0, N + 1) if i % 2 == 1]
print(len(l) / N)

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

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

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

if n == 1:
  ans = float(1)
  print(ans)
  exit()

if n % 2 == 1:
  s = (n + 1) / 2
  ans = s / n
  print(ans)
  exit()
  
ans = float(0.5)
print(ans)

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


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

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

    

if __name__ == "__main__":
    main()

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

print(N_odd/N)

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

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

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

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

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

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

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

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

ans = 0;

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

print(ans)

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

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

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

Solution (Python):
n = int(input())
 
count = 0
 
for i in range(n):
    if i % 2 != 0:
        count += 1
    else:
        pass
 
print(1-float(count/n))

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

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

Solution (Python):
import sys
from fractions import gcd
from itertools import groupby as gb
from itertools import permutations as perm
from itertools import combinations as comb
from collections import Counter as C
from collections import defaultdict as dd
sys.setrecursionlimit(10**5)
def y(f):
    if f:
        print('Yes')
    else:
        print('No')
def Y(f):
    if f:
        print('YES')
    else:
        print('NO')

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

Solution (Python):
import random

N = input()
N = float(N)
w = N / 2
s = N % 2
ans = (int(w)+s) / N
print(ans)

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

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

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

Solution (Python):
num = int(input())
if num % 2 == 0:
    print("{0:6f}".format((num / 2)/num))
else:
    print("{0:6f}".format((int(num / 2) + 1)/num))

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

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

Solution (Python):
import numpy as np
N=int(input())

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
no=int(input())
n=no
c=0
while(n>0):
  if n%2 == 1:
    c += 1
  n -= 1
print(c/no)

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

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

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

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

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

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

print( 1.0 - N // 2 / N)

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):
input_line=input().rstrip()
kisuu=0
for number in range(1,int(input_line)+1):
  if number%2==1:
    kisuu=kisuu+1
possi=kisuu/int(input_line)
print(possi)

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

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

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

Solution (Python):
N = int(input())
q , mod = divmod(N , 2)
if(mod==0):
	print(0.5)
else:
	print((q + mod) / 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==0):
	ans = 1/2
else:
	ans = (n//2+1)/n
	
print(ans)

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

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

Solution (Python):


N = int(input())
count = 0

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

print('{:.10f}'.format(count/N))

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

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

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

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

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

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

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

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

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

print(cou/n)

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

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

print (a)

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

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

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

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

Solution (Python):
n = int(input())
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):
import random

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

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

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

Solution (Python):
def filter_odd(x):
    return x % 2 == 1


def solve(N):
    odd_list = list(
        filter(filter_odd, range(1, N + 1)[::-1])
    )
    return len(odd_list) / N


N = int(input())

print(solve(N))

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

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

Solution (Python):


 
a = float(input())
 
gusu = a / 2
ngusu = a // 2
 
if gusu > ngusu:
  kisu = ngusu + 1
else:
  kisu = ngusu
kaku = kisu / a 

print(kaku)

Solution (Python):


import math
 
a = float(input())
 
gusu = a / 2
ngusu = math.floor(gusu)
 
if gusu > ngusu:
  kisu = ngusu + 1
else:
  kisu = ngusu
kaku = kisu / a 

print(kaku)

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



'''

a = int(input())
a,b,c.. = map(int,input().split())

n = int(input())
a = [int(input()) for _ in range(n)]

n,k,x,y = [int(input()) for _ in [0]*4];print(x*k+y*(n-k) if n > k else x*n)




'''

Solution (Python):
def solve(N):
    odd_count = 0

    for x in range(1, N + 1)[::-1]:
        if x % 2 == 1:
            odd_count += 1

    if N == 1:
        return 1

    return odd_count / N


N = int(input())

print(solve(N))

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

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

print("{0:.10f}".format((N // 2 + N % 2) / N))

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

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

nums = [x for x in range(1,N+1)]
odds = [x for x in nums if x%2 == 1]
proba = len(odds)/len(nums)
print(proba)

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

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

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

counter = 0

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

print(counter/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())
cnt = 0
for i in range(1, N+1):
  if i % 2 != 0:
    cnt+=1
print(cnt/N)

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

Solution (Python):
import copy

def j(n):
    if n:print("yes")
    else:print("no")
    exit(0)
rem = 10 ** 9 + 7

"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def ipmultiplerow(n):
    a = []
    for i in range(n):
        a.append(ip())
    return a
def printrow(a):
    for i in a:
        print(i)

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

Solution (Python):
N=int(input())
if N%2==0:
  print(0.5)
else:
  print(1.0*(N//2+1)/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('{:.10f}'.format((n//2 + n%2)/n))

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

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

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

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

Solution (Python):
n = int(input())
odd = n - int(n/2)
print("{}".format(odd/n))

Solution (Python):

import numpy as np

N = int(input())

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

print(ans)

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

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

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

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

Solution (Python):

n = int(input())


cnt = n // 2

ans = (n // 2) / n

print(1 - ans)

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

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

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

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

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

Solution (Python):
import sys
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split()) 
DBG = True 

def ddprint(x):
  if DBG:
    print(x)

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

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

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

Solution (Python):
import sys,os,math
from collections import Counter, defaultdict, deque
import bisect
from sys import stdin, stdout
from itertools import repeat








def solve():

    pass

def main():
    n = map(int, raw_input().split())[0]
    print (n+1)/2/float(n)


main()

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

Solution (Python):
N = int(input())
odds = [i for i in range(1, N + 1) if i % 2 != 0]
print("{}".format(len(odds) / N))

Solution (Python):
N = float(input())
o = float( N / 2 / N )
e = float( (N / 2 + 0.5 ) / N )
if N == 1:
    print(1)
elif N % 2 ==0:
    print(o)
elif N % 2 ==1:
    print(e)

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

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

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

if n%2==1:
  print((math.floor(n/2)+1)/n)
  
if n%2!=1:
  print((n/2)/n)

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

if n % 2 == 0:
  a = (n / 2) / n
  print(format(a, ".10f"))
else:
  b = (((n - 1) / 2) + 1) / n
  print(format(b, ".10f"))

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

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

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

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

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

Solution (Python):

s = int(input())


odd = int(s / 2) + (s % 2)


ans = odd / s


print( ans )

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

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

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

if __name__ == "__main__":
  main()

Solution (Python):
import sys
import math

n = input()
n = float(n)
ans = (n - math.floor(n / 2))
ans = float(ans / n)
print(ans)

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

kisu = 0
gusu = 0

for i in range(1,N+1):
  if i % 2 == 1:
    kisu += 1
  else:
    gusu += 1
    
kakuritsu = kisu / (gusu + kisu)

print('{:.10f}'.format(kakuritsu))

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

kisu = 0

for i in range(1, N+1):
  if i % 2 == 1:
    kisu += 1
    
    
kakuritsu = kisu / N


print('{:.10f}'.format(kakuritsu))

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

Solution (Python):
import sys
import math

n = input()
n = float(n)
ans = (n - n / 2)
ans = math.ceil(ans)
ans = float(ans / n)
print(ans)

Solution (Python):
import math


def t(n):
    return math.ceil(n / 2) / n


if __name__ == "__main__":
    print(t(int(input())))

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

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

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

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

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

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

print(count/N)

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

Solution (Python):

N=int(input())

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

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

count = 0

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


print(count / num)

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

_n = int(input())

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

Solution (Python):



import sys


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








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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
n = int(input())
p = 0
for i in range(n+1):
    if i % 2 == 1:
        p += 1
print('{:.10}'.format(p/n))

Solution (Python):
n = int(input())
count = 0
for i in range(1, n + 1):
    if i % 2 == 1:
        count += 1
print("{:.10f}".format(count / n))

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

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

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

for i in range(N):
	if i % 2 is 0 :
		n += 1

print(n / N)

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

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

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

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

Solution (Python):
import sys

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

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

print('%.10f' %a)

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

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n = int(input().rstrip('\n'))
    print((n - n // 2) / n)


if __name__ == '__main__':
    slove()

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

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

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

Solution (Python):

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

Solution (Python):
N = int(input())
odds = len([i+1 for i in range(N)][0::2])
print(odds/N)

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

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

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

Solution (Python):
import math

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

Solution (Python):
n = int(input())
total = len(range(1,n+1))
if n % 2 == 0:
    mol = n // 2
else:
    mol = (n // 2) + 1
print(mol/total)

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

if N == 1:
    print(N)

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

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

if N == 1:
    print(float(N))

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

Solution (Python):
import math
n = int(input())
if n%2 == 0:
  print(1/2)
else:
  print(math.ceil(n/2)/n)

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

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

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

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

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    n = II()
    ans = 0
    for i in range(1, n + 1):
        ans += i & 1
    print(ans/n)
    return


def B():
    n, k = LI()
    h = LI()
    ans = 0
    for i in h:
        ans += i >= k
    print(ans)
    return


def C():
    n = II()
    a = LI()
    d = defaultdict(int)
    for i in range(n):
        d[a[i] + 1] = i + 1
    for _, v in sorted(d.items()):
        print(v, end=" ")
    print()
    return

def primes(n):
    """ Input n>=6, Returns a list of primes, 2 <= p < n """
    """ 6以上の数であれば p (素数) <= n のlistを返す """
    n, correction = n-n%6+6, 2-(n%6>1)
    sieve = [True] * (n//3)
    for i in range(1,int(n**0.5)//3+1):
        if sieve[i]:
            k=3*i+1|1
            sieve[      k*k//3      ::2*k] = [False] * ((n//6-k*k//6-1)//k+1)
            sieve[k*(k-2*(i&1)+4)//3::2*k] = [False] * ((n//6-k*(k-2*(i&1)+4)//6-1)//k+1)
    return [2,3] + [3*i+1|1 for i in range(1,n//3-correction) if sieve[i]]


def D():
    a, b = LI()
    p = primes(int(math.sqrt(max(a, b))) + 1)
    ans = 1
    for i in p:
        if a % i == b % i == 0:
            ans += 1
    print(ans)
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

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

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

print('{:.6f}'.format(prob))

Solution (Python):
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN

N = int(input())

if N%2==0:
    odd_count = N//2
else:
    odd_count = N//2+1
print('{:.10f}'.format(odd_count/N))

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

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

Solution (Python):
import math

N = int(input())


def prob_even(N):
    return 1/2
  

def prob_odd(N):
    return math.ceil(N/2)/N
  
if N%2 == 0:
    ans = prob_even(N)
else:
    ans = prob_odd(N)
    
print(ans)

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

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

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

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

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

odd = [x for x in range(1,N+1,2)]
all = [x for x in range(1,N+1)]
print(len(odd)/len(all))

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

print((n - math.floor(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())

n = (N+1)//2

print(n/N)

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

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

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

Solution (Python):

"""ABC142.ipynb

Automatically generated by Colaboratory.

Original file is located at
    https://colab.research.google.com/drive/1a5aajQRjVtRR5jXaooVlLtRM2WBIS2cv
"""

N=int(input())

def EO(x):
  if x % 2 == 0:
    return "Even"
  return "Odd"

if EO(N)=="Even":
  prob=0.5
else:
  prob=(int(N/2)+1)/N
print(prob)

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

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

print(odd/(odd + even))

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

print(answer)

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

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

Solution (Python):
import math

N = int(input())

if N % 2 == 0:
    print('0.5000000000')
else:
    n = math.ceil(N/2)
    print('{:.8f}'.format(n/N))

Solution (Python):
n = int(input())
cnt = 0
for i in range(1, n + 1):
    if i%2 != 0:
        cnt += 1
    else: 
        cnt+=0
print("{:.10f}".format(cnt/n))

Solution (Python):



n = int(input())
oddnum = 0 

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

print(oddnum/n)

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

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

if N % 2 == 0:
    print(0.5)
else:
    print((math.floor(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 % 2) / N)

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

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

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(0.5 if n %2 ==0 else (n-n//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())
a = [0]
a = [i for i in range(1,n+1)]
c = a[0::2]

print(float(len(c)/len(a)))

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

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

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

Solution (Python):

import sys
import math

def solve(N: int):
    odd = math.floor(N / 2) if not N % 2 else math.floor(N / 2) + 1
    print("{0:.10f}".format(odd / 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):
import sys
import math
input = sys.stdin.readline

N = int(input())

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

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

Solution (Python):
import math

n = int(input())

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

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

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

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

even = N // 2
odd = N - even

ans = odd / N

print(ans)