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

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

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

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

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

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

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

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

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

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

Solution (Python):
n = int(input())
oddCount = len(list(filter(lambda x: x % 2 == 1, range(1,n + 1))))
print(oddCount / n)

Solution (Python):
import math

n=int(input())

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

Solution (Python):
import sys




def main():
    N = int(input())
    eve = int(N//2)
    print((N-eve)/N)


if __name__ == "__main__":
    main()

Solution (Python):
n=int(input())
a=0
for i in range(1,n+1):
  a+=(i%2)
print(a/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):
"""
    こんにちは。これはクシャルです
    
    Author : thekushalghosh (クシャル)
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()



def solve():
    n = inp()
    print(0.5 if n % 2 == 0 else 1 - ((n // 2) / n))
            


 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    

def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 

def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1],1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97],1
    return(q)

def factors(n):
    q = []
    for i in range(1,int(n ** 0.5) + 1):
        if n % i == 0: q.append(i); q.append(n // i)
    return(list(sorted(list(set(q)))))

def prime_factors(n):
    q = []
    while n % 2 == 0: q.append(2); n = n // 2
    for i in range(3,int(n ** 0.5) + 1,2):
        while n % i == 0: q.append(i); n = n // i
    if n > 2: q.append(n)
    return(list(sorted(q)))


        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
main()

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

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

Solution (Python):


import math
n = int(input())
print(math.ceil(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())
count=0
for i in range(1,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())
print((n-n//2)/n)

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

Solution (Python):
def yn(yn):
    if yn:
        print("Yes")
    else:
        print("No")


a = input()

a = int(a)

print(((a + 1) // 2) / a)

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

Solution (Python):
import math

N = int(input())

if N % 2 == 0:
    ans = 0.5
else :
    ans = math.ceil(N / 2) / N

print(ans)

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

Solution (Python):


n = int(input())

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

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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


if __name__ == '__main__':
    main()

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

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

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

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

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())
k=[i for i in range(1,n+1,2)]
print(len(k)/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())
print('{:.8f}'.format((N + 1) // 2 / N))

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

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

if __name__ == '__main__':
    main()

Solution (Python):
def main():
    n = int(input())
    
    m = n - (n // 2)
    ans = m / n
    print(ans)
    
if __name__ == '__main__':
    main()

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

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

Solution (Python):
import math
n = int(input(""))
print((n-math.floor(n/2))/n)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

x = odd/n
print('%.10f' % x)

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

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

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

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

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

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

Solution (Python):

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

if __name__ ==  "__main__":
    main()

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

Solution (Python):
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a=ii()
if a%2==0:
  print(1/2)
else:
  print(math.ceil(a/2)/a)

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

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

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

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

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


if __name__ == '__main__':
    solve()

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

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

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

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

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

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

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

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

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

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

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

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

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

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

print(ans)

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

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

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

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

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

Solution (Python):



import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline




N = int(input())

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import math


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

    if N % 2 == 0:
        print("{:.11f}".format((N / 2) / N))
    else:
        print("{:.11f}".format(math.ceil(N / 2) / N))


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

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

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

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

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

O = [i for i in range(1, N+1) if i % 2 == 1]

print(len(O) / N)

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

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

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

input = lambda: sys.stdin.readline().rstrip()


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

    print(ans)


if __name__ == '__main__':
    solve()

Solution (Python):
import math

n = int(input())

answer = (n - math.floor(n / 2)) / n

print(answer)

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

nums = list(range(1, n+1))

odds = [x for x in nums if x % 2 == 1]


if len(nums) % 2 == 0:
	print(0.5)
else:
  	print(len(odds) / len(nums))

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

for i in range(1,N+1):
    if i % 2 != 0:
        count += 1
print("{:.10f}".format(count / N))

Solution (Python):
n = int(input())
if n % 2 == 0:
    o = n//2

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

Solution (Python):
s=0
t=0
n=int(input())
if n%2==1:print((n+1)/2/n)
else:print(n/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())
odds_size = -(-N//2)
print(odds_size/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):
import os, sys, re, math

N = int(input())

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

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

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

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

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

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

Solution (Python):
import sys
import decimal 

def input():
    return sys.stdin.readline().strip()

def main():
    n = int(input())
    n = decimal.Decimal(n)
    if n % 2 == 0:
        print(1/decimal.Decimal(2))
        return
    
    print(((n-1)/2+1)/n)

    
    
main()

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

Solution (Python):
import math

n = int(input())


ans = math.ceil(n / 2)


print(ans / n)

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

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

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

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

if __name__ == "__main__":
    main()

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

Solution (Python):

n = int(input())
print((n - n//2)/n)

Solution (Python):
def main():
  num = int(input())
  print(1-((int(num/2)/num)))
main()

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

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

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

Solution (Python):

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

Solution (Python):
import math

def main():
    n=int(input())
    print(math.ceil(n/2)/n)
                
if __name__ == '__main__':
    main()

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

lis =[]
for i in range(1,n+1):
    lis.append(i)
    
odd =[]
for j in lis:
    if j % 2 != 0:
        odd.append(j)
        
print(len(odd)/len(lis))

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    n = int(input())
    if n % 2 == 0:
        print(1 / 2)
    else:
        print((n // 2 + 1) / n)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

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

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

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

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

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

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

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

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

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

Solution (Python):
import math
import itertools
n = int(input())
 
if(n %2 == 1):
    d = int((n-1)/2) + 1
else:
    d = int(n/2)
 
ans = d/n
 
print('{:.08f}'.format(ans))

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

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

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

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

Solution (Python):

import sys
import math

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


def main():
    N = int(readline())
    print(math.ceil(N / 2) / N)


if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
if n==1:print(1)
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):
import sys

sys.setrecursionlimit(10000000)
import os
import math
import bisect
import collections
import itertools
import heapq
import re
import queue



ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)


MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    n = N//2
    print((N-n)/ N)


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

Solution (Python):
def odds_of_oddness(n):

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

if __name__ == '__main__':
    main()

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

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

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

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

else:
  print(1/2)

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

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

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

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

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

print(ans)

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

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

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

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

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



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

odd = (n + 1) // 2
ans = odd / n
print('{:.9f}'.format(ans))

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

Solution (Python):
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

N = ri()

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

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

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

num = (N+1)//2

print(num/N)

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

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

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

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

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

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

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

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

if __name__ == '__main__':
    main()

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

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

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

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

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

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

Solution (Python):


n = int(input())

sup = n % 2
odd_num = n//2+sup
even_num = n//2

print(odd_num/(even_num+odd_num))

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

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

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

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

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

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

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

a=n//2+n%2

print(a/n)

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

m = 0
for i in range(1, n+1):
  if i % 2 == 1:
    m += 1
    
print(m / 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(0.5)
elif N == 1:
    print(1)
else:
    c = (N - 1) // 2
    print((c + 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())
cnt=0
ans=0
for i in range(1,n+1):
  cnt+=1
  if i%2==1:
    ans+=1
    
print(ans/cnt)

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

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

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

b = range(1, n)

a = b[::2]
print(1 - (len(a) / 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())
print(1-(n//2)/n)

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

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

Solution (Python):
import sys
import math
import bisect


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



if __name__ == "__main__":
    main()