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

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

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

a = a + 1
print('{:.08f}'.format(a / n))

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


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

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

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

m=n//2
l=n-m
answer=l/n

if n==1:
  print(1)
else:
  print(answer)

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

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

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

numEven = N // 2
print(1.0 - numEven / N)

Solution (Python):
import math

n=int(input())

print((n-math.floor(n/2))/n)

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

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

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

print(1-(n//2)/n if not n%2==0 else 0.5000000000)

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

Solution (Python):


N = int(input())

D = []

for i in range(1,N+1):
    D.append(i)



cnt = 0

for j in D:
    if j % 2 != 0:
        cnt += 1



print(cnt / len(D))

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

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

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

print(ans)

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

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

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

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

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

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

g = 0
for n in range(1, N + 1):
    if n % 2 == 0:
        g += 1

ANS = (N - g) / N

print(ANS)

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:
    a=n/2
else:
    a=n//2+1

print(a/n)

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

if n % 2 == 0:
    odd_count = n // 2
else:
    odd_count = n // 2 + 1
print(odd_count / 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())
count=0
for i in range(0,n):
	if(i%2==0):
			count+=1
			
	else:
		count+=0
	
print(count/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((n+1)//2/n)

Solution (Python):


from typing import *
import collections
import functools as fts
import itertools as its
import math
import sys

INF = float('inf')


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


def main():

    sys.setrecursionlimit(10 ** 6)

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

num_even = N//2
num_odd = N - num_even

print(num_odd/N)

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

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

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

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

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

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

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

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

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

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

Solution (Python):

n=int(input())
if n%2==0:
    print('0.5000000000')
elif n==1:
    print('1.000000000')
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())
odd_cnt = N - N // 2
print(odd_cnt / N)

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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

    print(odd / N)


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

Solution (Python):


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

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

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

if n >= 2:
    print((1-(n//2 / n)))
else:
    print(n / n)

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

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

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

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

    print(f"{ans:.10f}")


if __name__ == "__main__":
    main()

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

Solution (Python):
def readinput():
    n=int(input())
    return n

def main(n):
    if n%2==0:
        return 0.5
    else:
        return (n//2+1)/n


if __name__=='__main__':
    n=readinput()
    ans=main(n)
    print(ans)

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

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

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

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

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

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

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

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

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

l=[x for x in range(1,n+1)]

p=0

for ll in l:
  if ll%2!=0:
    p+=1

print(p/len(l))

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

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

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

even=n//2
a=(n-even)/n
print(a)

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

ans=0

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

print(ans/N)

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

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

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

print(cnt/n)

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

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

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

Solution (Python):
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy


import heapq
sys.setrecursionlimit(10**6)

INF = 10**18
import bisect
import statistics
mod = 10**9+7


N = int(input())

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

Solution (Python):

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

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy








def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

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

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

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

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

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

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('{:.10f}'.format((n / 2) / n))
else:
    print('{:.10f}'.format(((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((n//2)/n)
else:
    print((n//2 + 1)/n)

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

Solution (Python):

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


if __name__ == "__main__":
    main()

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

cnt = 0
for n in N:
    cnt += n%2!=0
    
print(cnt/len(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( (n-n//2)/n )

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

for i in range(n + 1)[1:]:
  if i % 2 == 1:
    cnt += 1
    
print(cnt / n)

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

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

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

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

Solution (Python):
import math
N = int(input())
mol = math.ceil(N/2) if N % 2 != 0 else N//2
print(mol/N)

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

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

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

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

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

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

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

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

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

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

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

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

even = N // 2
odd = N - even

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

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

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

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

Solution (Python):
from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
import math
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math as M
MOD=10**9+7
import random

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

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

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

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

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

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

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

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

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

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

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

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

print(ans)

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

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

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

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

Solution (Python):






n = int(input())

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

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

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

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

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

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

Solution (Python):


def main():

    N = int(input())

    num = 0

    for i in range(N + 1):
        if i % 2 > 0:
            num += 1
    
    ans = num / N

    print(ans)


if __name__ == "__main__":
    main()

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

print(n_odd / N)

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

Solution (Python):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

n=k()
if n == 1:
    print(1)
    sys.exit()

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin

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

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

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

odd_counter = 0
for i in range(1, n + 1):
    if i % 2 == 1:
        odd_counter += 1
print(odd_counter / 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):
n = int(input())
ans = -(-n // 2) / n
print(ans)

Solution (Python):











































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    N = int(lines[0])
    
    
    
    
    
    
    
    
    

    result = (-(N//-2)) / N

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['4']
        lines_export = [0.5000000000]
    if pattern == 2:
        lines_input = ['5']
        lines_export = [0.6000000000]
    if pattern == 3:
        lines_input = ['1']
        lines_export = [1.0000000000]
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools









N = int(input())
ans = 0

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

print(ans/N)

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

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

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

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

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

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

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

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

Solution (Python):
t = 1


def max(a,b):
	if a > b:
		return a
	return b
while t > 0:
	t -= 1
	n = input()
	n =int(n)
	ans = 0.5
	if n%2 == 1:
		
		ans = (n//2 + 1.0)/(n*1.0)
	print(ans)

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

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

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

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

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

Solution (Python):
N = int(input())
q, r = divmod(N, 2)
print((q + r) / N)

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

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

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

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

if not ( 1 <= N <= 100 ):sys.exit()

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

Solution (Python):
import math

n = int(input())

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

Solution (Python):
def odd(num):
	return num//2+num%2

N=int(input())

num = odd(N)/N
print("{:.10f}".format(num))

Solution (Python):
N = float(input())
S = N
count = 0
while (N > 0):
  if N % 2 != 0:
    count += 1
  N = N - 1
print(count / S)

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

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

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

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

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

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

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

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

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

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

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

if n % 2 == 0:
  print("{:.9f}".format(0.5))

else:
  print("{:.9f}".format((n + 1) // 2 / 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())
if N % 2 == 0:
  print(1/2)
else:
  print((N+1)/(2*N))

Solution (Python):


n = int(input())
a=n//2+(n%2)
print(a/n)

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

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

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

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

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

L = [i for i in range(N+1)]

odd = []

for j in range(N+1):
  if L[j] % 2 == 0:
    pass
  else:
    odd.append(L[j])
  j+=1

print(len(odd)/(len(L)-1))

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

m = range(1,n + 1)

a = range(1,n + 1,2)

b = len(a) / len(m)
print(b)

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

Solution (Python):

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

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

odd = N//2+(N%2==1)

print(odd/N)

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

Solution (Python):
import sys

def I(): return int(sys.stdin.readline().rstrip())

N = I()

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

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

Solution (Python):


import sys
import math


from sys import stdin,stdout
from collections import deque,defaultdict
from math import ceil,floor,inf,sqrt,factorial,gcd,log2
from copy import deepcopy
ii1=lambda:int(stdin.readline().strip())
is1=lambda:stdin.readline().strip()
iia=lambda:list(map(int,stdin.readline().strip().split()))
isa=lambda:stdin.readline().strip().split()
mod=int(1e9 + 7)

n=ii1()
if n==1:
    print(1)
elif n%2==0:
    print(1/2)
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):
n=int(input())
if n==0:
	p=0
	print("%.9f"%p)
elif n&1:
	p=(n//2)+1
	print("%.9f"%(p/n))
else:
	p=n//2
	print("%.9f"%(p/n))

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):





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

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

Solution (Python):
n = int(input())
count = 0
result = 0
for i in range(n+1):
  if i % 2 == 0:
    pass
  else:
    count +=1

result = count / n

print(result)

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

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

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

Solution (Python):


import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(read())

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

print(odd/N)

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

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

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

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

Solution (Python):
import sys

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

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

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

elif 2<=N and N%2 != 0:
    print(((N+1)//2)/N)

else:
    print("1.00000")

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

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

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

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

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