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

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

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

Solution (Python):
a = input().split()
N = int(a[0])
ans = 0.5
if N%2 == 0:
    pass
else:
    ans = (N+1)/(2*N)

print(ans)

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

Solution (Python):

import sys


def solve(N: int):
    if N % 2 == 0:
        print("%.10f" % 0.5)
    else:
        print("%.10f" % ((N+1)/(2*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):



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


if __name__ == '__main__':
    solve()

Solution (Python):
import copy
import random
import bisect 
import fractions 
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) 

def LI(): return list(map(int, sys.stdin.readline().split()))

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

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

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

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

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

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

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

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

Solution (Python):
def solve(n):
    return ((n+1) // 2) / n

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

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

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

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

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

Solution (Python):
import sys


		
def main():
	a = int(input())
	aa=len([v for v in range(1,a+1) if v % 2 ==1])

	print(aa/a)
	
	

isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

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

if N % 2 == 0:
    print(0.5)
else:
    a = math.ceil(N/2)
    print(a/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):
x = input()
xNum = int(x)

if xNum%2 == 0:
  count = xNum/2
else:
  count = int(xNum/2) + 1

print(count/xNum)

Solution (Python):
n=int(input());print([0.5,(n+1)//2/n][n%2>0])

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):


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

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
num_list = list(range(1,n+1))
odd_list = num_list[::2]
print(len(odd_list)/n)

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)


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


if __name__ == '__main__':
    main()

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)


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


if __name__ == '__main__':
    main()

Solution (Python):
import math

N = int(input())

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

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

if N == 0:
  print(0.0000000000)
  
elif N == 1:
  print(1.0000000000)
  
else:
  a = int(N / 2)
  b = N - a
  c = b / N
  print(c)

Solution (Python):
x = int(input())
y = []
y = [x for x in range(1, x + 1) if x % 2 != 0]
z = len(y) / x
print('{:.9f}'.format(z))

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

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

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

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

print(ans)

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

odds = list(filter(lambda x: x % 2 != 0,range(1,n+1)))
print(len(odds) / n)

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

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

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

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

print(m/N)

Solution (Python):
_n = int(input())
_odd = 0.0
_even = 0.0
for _i in range(_n):
  _num = _i + 1
  if _num % 2 == 0:
    _even = _even + 1
  else:
    _odd = _odd + 1
_prob = _odd / (_odd + _even)
print(_prob)

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

Solution (Python):

N = int(input())


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

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

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

even = N // 2
print('{:.10f}'.format(1-(even/N)))

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import math

N = float(input())

print('{:.10f}'.format(1-math.floor(N/2)/N))

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

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

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

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


if __name__ == '__main__':
  main()

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

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

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

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

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

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

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

Solution (Python):
from math import ceil

if __name__ == "__main__":
    n = int(input())
    print(ceil(n/2)/n)

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

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

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

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

Solution (Python):

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

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

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

Solution (Python):
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string


import random
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def StoI():
    return [ord(i)-97 for i in input()]
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7



show_flg=False
show_flg=True


n=I()
ans=1-(n//2)/n
for i in range(n):
    0
    
print(ans)

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

Solution (Python):
def func(N):
    count = 0
    for i in range(N):
        if (i + 1) % 2 != 0:
            count += 1
    return count / N

N = int(input())
print(func(N))

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

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

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

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


if __name__ == "__main__":
    resolve()

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

Solution (Python):
from math import ceil
a = int( input())
print((ceil(a / 2) / a, 1)[a == 1])

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

Solution (Python):
from math import *

def next_int():
    return int(input())

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

n = next_int()
t = 0
for i in range(n):
    if i+1 & 1:
        t += 1
print(t/n)

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

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

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

import math
n = math.ceil(N/2)

print(n/N)

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

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

p = count/N

print(p)

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

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

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

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
if __name__ == "__main__":
    N = int(input())
    tmp = int()
    for i in range(1,N+1):
        if i % 2 == 0:
            continue
        else:
            tmp+=1
    print(tmp/N)

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

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

print (count/N)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import unittest
import sys

def count_odds_of_odd(n):
	
	if n == 1:
		return float(1)
	else:
		odd_count = (n / 2) + (n % 2)
		
		odds_of_odd = float(odd_count) / float(n)
		return odds_of_odd

def read_input():
	
	n = int(sys.stdin.readline())
	return count_odds_of_odd(n)

class testMyCode(unittest.TestCase):
	def test_1(self):
		res = count_odds_of_odd(1)
		self.assertEqual(res, 1)
		res = count_odds_of_odd(4)
		self.assertEqual(res, 0.5)
		res = count_odds_of_odd(5)
		self.assertEqual(res, 0.6)

if __name__ == '__main__':
	res = read_input()
	print res

Solution (Python):

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

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

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

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

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

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

odd = -(-a//2)
even = a//2

print(odd/(odd+even))

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

Solution (Python):
def main():
    N = int(input())
 
    if (N < 0 or N > 100):
        return 0
    array_len = len([N for i in range(1, N+1) if(i%2==1)])
    result = array_len / N
    return result
    
if __name__ == "__main__":
    print(main())

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

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

    
if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20

N = int(input())
half = N // 2
print((half + N%2)/N)

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

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

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))



N = I()

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

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

Solution (Python):


import math
import os
import sys


DEBUG = 'DEBUG' in os.environ


def inp():
    return sys.stdin.readline().rstrip()


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


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


if __name__ == '__main__':
    main()

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

if n%2>0:
  ans = int(n/2)+1
  print(format(ans/n, '.11f'))
  
else:
  ans = int(n/2)
  
  print(format(ans/n, '.11f'))

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

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

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

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

Solution (Python):

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


if __name__ == "__main__":
    main()

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

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

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

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

print(x/n)

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

a = int(input())
if a % 2:
  print(float((a - (a - 1) / 2) / a))
else:
  print(float(0.5))

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

evens = n // 2
odds = n - evens

print(odds / n)

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

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

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

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

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

Solution (Python):
from collections import Counter
mod = 1000000007


def inverse(a):
    return pow(a, mod - 2, mod)


def usearch(x, a):
    lft = 0
    rgt = len(a) + 1
    while rgt - lft > 1:
        mid = (rgt + lft) // 2
        if a[mid] <= x:
            lft = mid
        else:
            rgt = mid
    return lft


def update(x, y, new_value, dp):
    if 0 <= x < len(dp) and 0 <= y < len(dp):
        dp[x][y] = min(dp[x][y], new_value)

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

main()

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

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

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

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

Solution (Python):
from math import ceil

n = int(input())

if n % 2:
    print(ceil(n/2)/n)
else:
    print((n//2)/n)

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

Solution (Python):

import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

if __name__ == '__main__':
    main()

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

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

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

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


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


if __name__ == '__main__':
    main()

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

Solution (Python):
import math
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

n = INT()
if n%2==0:
    print(0.5)
else:
    print(math.ceil(n/2)/n)

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

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

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

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

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

Solution (Python):
from sys import stdin

input = stdin.readline
mi = lambda: map(int, input().split())
lmi = lambda: list(mi())
si = lambda: input().strip('\n')
ii = lambda: int(input())

n = int(input())
a = n//2
b = n-a
print("{:.6f}".format(b/n))

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

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

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

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

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

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

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

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

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

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

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

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

q, mod = divmod(N, 2)

print('{:.10g}'.format((q+mod)/N))

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

Solution (Python):
N = int(input())
b = float(1.0)

if N == 1:
  pass
elif( N % 2 == 0):
  b = 0.5
else:
  b = float((N +1)/2/N)
print(b)

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

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

Solution (Python):
N = int(input())
kisuu = (N/2)
kisuu = -(-N // 2)
result = kisuu/N
print("{:.6f}".format(result))

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

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

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

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.000000
b = 0.000000

for i in range(1,n+1):
    if i%2 == 0:
        a += 1
    else:
        b += 1
print('{:.10g}'.format(b/(a+b)))

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

Solution (Python):


N = int(input())


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

print(num_odds/N)

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

Solution (Python):
from math import ceil

n = int(input())
ans = (ceil(n/2))/n
print('{:.6f}'.format(ans))

Solution (Python):
def main():
    n = int(input())
    l = [x for x in range(1, n + 1) if x % 2 == 1]
    print(l.__len__() / n)


if __name__ == "__main__":
    main()

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

Solution (Python):



N=int(input())
i=0
c=0
while i < N+1:
    i+=1
    if i%2==0:
        c+=1
    else:
        continue
    
print(c/N)

Solution (Python):
N = int(input())
cnt = 0
ans = 0

for i in range(1,N+1):
     if i % 2 == 1 :
        cnt += 1
ans = cnt / N
print('{:.10f}'.format(ans))

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

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

i = 1
odds = 0
while i <= a:
    if i % 2 == 1:
        odds = odds + 1
        i = i +1
    else:
        i = i + 1

print(odds/a)

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

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

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

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

if (n % 2 == 0):
  answer = (n/2) / n

else:
  answer = ((n+1) / 2) / n

print(answer)

Solution (Python):
import decimal
num_list = []
s = int(input())
num_list = list(range(1,s + 1))
odd = decimal.Decimal(len(num_list[0::2]))
print('{:.10f}'.format(1 * (odd / decimal.Decimal(s))))

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

if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
n = int(input())
even, odd = n >> 1, (n >> 1) + (n & 1)
print(odd / n)

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

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

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

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

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

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

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

if number % 2 == 0:
    final = (number // 2) / number
    print("%.6f"% final)
elif number % 2 != 0:
    final = ((number // 2) + 1) / number
    print("%.6f"% final)

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

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

Solution (Python):

N = int(input())

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

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

probability = 0.0
if a%2 == 0:
	probability = 0.5
else:
	probability = 1.0/float(a)*(int(a/2) + 1)
  
print(probability)

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

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

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

Solution (Python):


N=int(input())

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

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

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

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

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

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

Solution (Python):

n = int(input())
if n % 2 == 0:
    print(0.5)
else:
    odds = (n-1)/2 + 1
    print(odds / 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('%0.7f' % (((n >> 1) + (n & 1)) / n))

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

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

Solution (Python):

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

Solution (Python):
import numpy as np

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

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

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

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

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