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

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

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

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

Solution (Python):
import math
N = int(input())
a=N//2
b=N-a

print(b/N)

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

Solution (Python):



a = int(input())
A = a
b = 0

while (a>0):
    if a %2 == 1:
        b+=1
    a -= 1
print(float(b/A))

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
cnt = int(input())
cnt_odd=[]


for i in range(cnt+1):
    
    if i%2==1:
        
        cnt_odd.append(i)

print(len(cnt_odd)/cnt)

Solution (Python):
from sys import stdin

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

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

print('{:.8f}'.format(len(arr)/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 // 2) / n)

Solution (Python):
n = int(input())
odd = []

for i in range(n+1):
  if i%2 != 0:
    odd.append(i)
    
ans = len(odd)/n
print(ans)

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

Solution (Python):
import sys

n = int(input())

if n%2 == 1:
    print('{:.10f}'.format(float((((n-1)/2)+1)/n)))
else:
    print('{:.10f}'.format(float((n/2)/n)))

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    n=int(input())
    k=(n+1)//2
    print(k/n)
resolve()

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

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

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

Solution (Python):
n=int(input())
q,r=divmod(n,2)
if r==1:
  print((q+1)/n)
else:
  print(q/n)

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

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

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

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

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

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

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

if N%2 == 0:
    print(0.5)
elif N%2 == 1 and N != 1:
    print(-(-N//2)/N)
elif N == 1:
    print(1)

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

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

Solution (Python):
N = int(input())
n= N/2 + 1/2
import math
a = math.floor(n)
 
print(a/N)

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

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

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

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

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

a = float(N-int(N/2))

print(a/N)

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

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

p /= n
 
print(p)

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

m = n // 2 

print((n-m)/n)

Solution (Python):
n=int(input())
count=0
i=1
while i<=n:
	if i%2!=0:
		count+=1
	i+=1

print(count/n)

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

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

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

print(ans)

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

a=k//2

print(1-a/k)

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

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

Solution (Python):



N = int(input())

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

print(odd / N)

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

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

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

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

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

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

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

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

if n%2 == 0:
	print(format(0.5, '.10f'))
else:
	print(format((n//2  + 1)/ n, '.10f'))

Solution (Python):
import math
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys

num = int(input())
ans=0
for index1 in range(1,num+1):
	if  index1%2==1:
		ans +=1
print(ans/num)

Solution (Python):
N=int(input())
if N%2==1:
    s=N//2+1
else:
    s=N//2
print('{:.8f}'.format(s/N))

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

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

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

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

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

print(odd_n/n)

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

print(1-(i//2)/i)

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

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

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

Solution (Python):

import sys
import math

def solve(N: int):
    a = 0
    if (N % 2 == 0):
        a = N / 2
    else:
        a = math.floor(N / 2)+1
    print(a/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())
s = n // 2
l = n % 2
to = (s + l) / n
print(to)

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

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

print(cnt/n)

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

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

def kaku(n):
	if n%2 == 0:
		return 0.5
	else:
		return 0.5*(n+1)/n
    
print(kaku(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())

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

print(count / N)

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

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

Solution (Python):
a=int(input())
d=0
for num in range(a+1):
    c=num%2
    if c==1:
        d+=1
print(d/a)

Solution (Python):
import math
import sys

def main():
    n = int(input())
    odd = int(n/2) + (n%2)
    print('%.10f'%(odd/n))

if __name__ == '__main__':
    sys.exit(main())

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

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

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

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

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

print(ans)

Solution (Python):


N = int(input())

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

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

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

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

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

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




def I(): return int(input())


def IsIl(): return list(map(lambda x: int(x), input().split()))


def InIl(n): return [input() for i in range(n)]


def IsIt(): return map(lambda x: int(x), input().split())


def InIl(n): return map(input() for i in range(n))


def SsSl(): return list(map(lambda x: x, input()))




def SSd():
    from collections import defaultdict
    A = input() 
    dd=defaultdict(int)
    for a in A:
        dd[a]+=1
    return dd






n = I()

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

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

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

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

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

print(x)

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

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

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

Solution (Python):
from math import ceil

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

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

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

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

Solution (Python):
n = int(input())
print(sum(map(lambda x: x%2 == 1, range(1, n+1)))/n)

Solution (Python):
n = int(input())
t = 0
if n%2==0:
    t = n//2
else:
    t = (n//2+1)
print(t/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())
k = 0
g = 0
for i in range(1,n+1) :
    if i % 2 == 0:
        g += 1
    else :
        k += 1
print(k/(g+k))

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

Solution (Python):
import sys

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

    for x in range(1, N+1):
        if(x%2==1):
            c+=1

    print("{0}".format(float(c/N)))

main()

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

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

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

print(odd/N)

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

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

Solution (Python):
import decimal
import math
decimal.getcontext().prec = 10
n = decimal.Decimal(int(input()))

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

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

print(ceil(N/2)/N)

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

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

print(odd/n)

Solution (Python):
import math

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

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

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

Solution (Python):
n=int(input())
a=[x+1 for x in range(n)]
cnt=0
for i in a:
  if(i%2!=0):
    cnt+=1
print("{:.6f}".format(cnt/n))

Solution (Python):
N=list(map(int,input().split()))
x=[]
for i in range(1,(N[0]+1)):
    x.append(i)
even_x=0  
odd_x=0  
for j in range(1,(x[-1]+1)):
    if j/2==int(j/2):
        even_x+=1
    else:
        odd_x+=1
output=odd_x/(odd_x+even_x)
print(output)

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

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

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

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

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

if (n % 2 == 0):
    print (format(0.5, ".10f"))
elif (n == 1):
    print (format(1.0, ".10f"))
else:
    print (format(((n//2)+1)/n, ".10f"))

Solution (Python):
A=input()
N=int(A)
B=int((N+1)/2)
print('{:.9f}'.format(float(B)/float(N)))

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

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

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

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

Solution (Python):
import math

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

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

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

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

odds_ratio = odds_counter / N
print(odds_ratio)

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

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

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

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

Solution (Python):
import numpy as np
N = int(input())
a = np.arange(1, N+1)
print((a % 2).mean())

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

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

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

Solution (Python):
import math

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

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

P = 1.0*((N-1)/2 +1) / N
print "{:12.10f}".format(P)

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

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

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

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

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

ans = 1.0
if n > 1 and n%2==1:
  ans = (n//2 + 1)/n
elif n%2==0:
  ans = 0.5
print(ans)

Solution (Python):
n = int(input())
class Odds_of_oddness:
  def __init__(self,n):
    self.n = n
    self.l = range(1,n+1) 
    self.count = 0
  def solve(self):
    for i in self.l:
      if i % 2 == 1:
        self.count += 1
    return self.count/len(self.l)    
  
ooo = Odds_of_oddness(n)
ans = ooo.solve()  
print(ans)

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

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

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

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

if a % 2 == 1:
	tmp = a // 2 +1
else:
	tmp = a / 2 

print('{:.6f}'.format(tmp / a))

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

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

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

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

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

Solution (Python):

def main():
    N = int(input())
    print(len(range(1,N+1,2))/len(range(1,N+1)))
    return 

main()

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

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

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n = int(readline())
    print((n - n // 2) / n)


if __name__ == '__main__':
    solve()

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

Solution (Python):
n = int(input())
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 == 0):
        print(".50000000")
else:
    n=(n+1)/(2*n)
    print('%.6f'%n)

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

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

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())
print(math.ceil(n / 2) / n)

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

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

Solution (Python):

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


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


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


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


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


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


def solve(N):
    o, e = 0, 0
    for i in range(1, N + 1):
        e += i % 2 == 0
        o += i % 2 == 1

    return o / (e + o)


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


if __name__ == '__main__':
    main()

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

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

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

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

odds = N - N//2
print(odds / N)

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

Solution (Python):
n=int(raw_input())
d=(n+1)/2
r=float(d)/n
print '%.10f' % r

Solution (Python):

import sys

import math












def main():
    n = int(sys.stdin.readline().rstrip())
    ans = math.ceil(n / 2) / n
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):

import sys














def main():
    n = int(sys.stdin.readline().rstrip())
    if n % 2 == 0:
        ans = 0.5
    else:
        ans = (n // 2 + 1) / n

    print(ans)


if __name__ == "__main__":
    main()

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

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


print("{:.6f}".format(c/N))

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

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

Solution (Python):
N = input()

N = int(N)

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

Solution (Python):
import math
n=int(input())
print(math.ceil(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());cnt=0
for i in range(n):
  if (i+1)%2==1:
    cnt+=1
print(cnt/n)

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

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

print(count_odd / N)

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

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

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

Solution (Python):
n = input()

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

Solution (Python):

n = input()


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

Solution (Python):

n = input()  


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

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

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

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

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

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

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

if __name__ == '__main__':
    abc142_a()

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

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

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

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

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

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

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

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

print(ans)

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

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

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

Solution (Python):



a=int(input())
b=a//2
c=a%2
Ans=(b+c)/a
print(Ans)

Solution (Python):
n=int(input())
i=1
count=0
while i<=n:
    if i%2==1:
        count += 1
    i += 1
print(count/n)

Solution (Python):
N = int(input())
odds = list(filter(lambda x: x % 2 != 0, range(1, N + 1)))
print("{:.10f}".format(len(odds) / float(N)))

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

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

print("{0:.10f}".format(ans/n))

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

Solution (Python):

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

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

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

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

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

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

q, mod = divmod(n, 2)
if mod == 1:
    print((q+1)/n)
else:
    print(0.5)

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

print(float(d))

Solution (Python):
import math

n=int(input())
oddCnt=math.ceil(n/2)
ret=(oddCnt/n)
print("{:.10f}".format(ret))

Solution (Python):
def main():
    n = int( input() )
    odd = 0
      
    for i in range(1, n+1):
      if( i % 2 == 1):
        odd += 1
        
    print( '{:.10g}'.format( odd / 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((n+1)/(2*n))

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

q, mod = divmod(n, 2)
if mod == 1:
    print((q+1)/n)
else:
    print(0.5)

Solution (Python):
def main():
    n = int(input())
    ct = 0
    for i in range(1,n+1):
        ct += i%2
    ans = ct/n
    print('{:.15f}'.format(ans))

if __name__ == "__main__":
    main()

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

Solution (Python):

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

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

Solution (Python):


N = int(input())
a = 0

if N % 2 == 0:
    a = 1 / 2
    print(a)
    
else:
    s = N // 2
    a = (s + 1) / N 
    a = round(a, 10)
    print(a)

Solution (Python):
N =float(input())
n2 = N/2
N2 = N%2
n3 = (n2/N)+(N2/(2*N))
print(n3)

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())
x = N % 2

if x == 0:
    ans = 1 / 2
else:
    ans = ((N - 1)/2 + 1) / N

print(ans)

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

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

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

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

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

Solution (Python):
N = int(input())
if (-1)**N == 1:
  odd = N/2
else:
  odd = (N+1)/2
p = odd/N
print(p)

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

Solution (Python):
import sys
read = sys.stdin.buffer.read

N = int(read())
odd = (N + 1) // 2
print(odd / N)

Solution (Python):
import math
n = int(input())
a = math.ceil(n/2)
b = n-a
if n == 1:
  print("1")
else:
  print(a/n)