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

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

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

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

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

print(M / N)

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

Solution (Python):
from math import ceil

N = int(input())

print(ceil(N/2) / N)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

if n % 2 == 0:
    ans = 1 / 2

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

print(ans)

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

print(ans)

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

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

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

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
def print_ans(input_line):
    """Test Case
    >>> print_ans(4)
    0.5000000000
    >>> print_ans(5)
    0.6000000000
    >>> print_ans(1)
    1.0000000000
    """
    q, mod = divmod(input_line,2)
    print((q + mod)/input_line)

if __name__ == '__main__':
    print_ans(int(input()))

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

if __name__ == '__main__':
    main()

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

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

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

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

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 = int(input())

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

Solution (Python):
import math

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

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

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

print(1-even/n)

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

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

Solution (Python):
from sys import stdin

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

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

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

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


a = n//2 + n%2

print(a/n)

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

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

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

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

Solution (Python):
import unittest


class TestA(unittest.TestCase):
    def test_4(self):
        
        self.assertEqual(think(4), 0.5)

    def test_5(self):
        self.assertEqual(think(5), 0.6)

    def test_1(self):
        self.assertEqual(think(1), 1.0)


def solve():
    n = read()
    result = think(n)
    write(result)


def read():
    return read_int(1)[0]


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(data):
    if data % 2 == 0:
        return 0.5
    return ((data + 1) // 2) / data


def write(result):
    print(result)


if __name__ == '__main__':
    
    
    
    solve()

Solution (Python):
from decimal import Decimal, ROUND_HALF_UP

a=int(input())

b= Decimal(str(a/2)).quantize(Decimal('0'), rounding=ROUND_HALF_UP)

c = b/a

print(c)

Solution (Python):
from decimal import Decimal, ROUND_HALF_UP

a=int(input())

b= Decimal(str(a/2)).quantize(Decimal('0'), rounding=ROUND_HALF_UP)

c = b/a

print(c)

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

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

c=0

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

Solution (Python):
num = int(input())
odd = 0
for n in range(1, num+1):

  if n % 2 == 1:
    odd += 1
print(odd/num)

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

Solution (Python):
n = float(input())
if n == 1:
    print(1)
    exit()

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

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

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

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

Solution (Python):
from sys import stdin

input = stdin.readline


def p_a():
    n = int(input())
    print(((n + 1) // 2) / n)


if __name__ == '__main__':
    p_a()

Solution (Python):
from sys import stdin
n = int(stdin.readline().rstrip())
if n % 2 == 0:
    even = n/2
    print('{:.10f}'.format(even/n))
else:
    odd = n//2 + 1
    print('{:.10f}'.format(odd/n))

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

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

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

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

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

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

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

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

Solution (Python):
n = int(input())
all_list = []
odd_list = []

for i  in range (1, n+1):
    if i % 2 == 0:
        all_list.append(i)
    else:
        odd_list.append(i)
        all_list.append(i)
        
print('{:.10f}'.format(len(odd_list)  / len(all_list)))

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

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

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


if a%2 == 0:
  print(0.50)
else:
  b=(a-1)/2 + 1
  c = b/a
  print(c)

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

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

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

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

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

Solution (Python):
from enum import Enum
from queue import Queue

import numpy as np

import collections
import bisect
import sys
import math

from scipy.sparse.csgraph import floyd_warshall

BIG_NUM = 200000000000
MOD = 1000000007
EPS = 0.000000001

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

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

Solution (Python):
n = int(input());
nn = 0;

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

Solution (Python):

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

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

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

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

b = list(range(1,N+1,2))

b_len = len(b)


print(len(b)/N)

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

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

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

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

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

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

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

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

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

count = 0

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

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

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

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

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

print("%.10f" % (count/t))

Solution (Python):
import math

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

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


if __name__ == '__main__':
    main()

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

print(Ans)

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

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

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

import math

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

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

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

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

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

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

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

if N%2==0 :
    print(0.5000000000)

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

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

print(ans)

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
    n = INT()
    print(ceil(n/2)/n)

if  __name__=='__main__':
    main()

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

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

Solution (Python):
import math
a = float(input())
result = 1 if a == 1 else math.ceil(a/2)/a
print(result)

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

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

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

if a%2==0:
  val = 0.5000000000

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

Solution (Python):

N = int(input())

number = 0

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

result = number / N

print(result)

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

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



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

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

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

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

print(odd_num/N)

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


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

print(ans)

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

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

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

if num % 2 == 1:
    count = num // 2 + 1
else:
    count = num // 2

odds = count/num

print(odds)

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

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

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

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

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

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

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

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

if __name__=='__main__':
	
	odds_of_oddness()

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

Solution (Python):
import numpy as np
N = int(input())
print(np.ceil(N/2)/N)

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

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

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

Solution (Python):
import sys

a = sys.stdin.readline().rstrip()
a_int = int(a)

if a_int%2==0:
    print("0.5")
elif a_int == 1:
    print("1.0000000000")
else:
    b = ((a_int - 1)/2 + 1) / a_int
    print('{:.10f}'.format(b))

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

n2 = n1 // 2

r1 = (n2 + (n1 - 2 * n2)) / n1 

print(r1)

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

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

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

print(counter/N)

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

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

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

Solution (Python):
n = float(input())
a = 0.5
if n == 1:
    print(n)
elif n%2 == 1:
    print((((n-1)/2)+1)/n)
elif n%2 == 0:
    print(float(a))

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

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

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

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

Solution (Python):
N = int(input())
answer = 0
O = 0

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

print(answer)

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

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

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

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

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

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

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

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

Solution (Python):



def rint():
    return int(input())


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


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

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

i=0
L=[]

while 2*i+1 <= N:
    j = 2*i+1
    L.extend([j])
    i += 1
a = int(len(L))
pro = a/N
print(pro)

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

Solution (Python):

n = int(input())

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


print(ret)

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

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

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

num = int((n + 1) / 2)

print(num / n)

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

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

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

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

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

odd_cnt = 0
even = 0

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

print(odd_cnt / 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())
a,b = n // 2, n % 2
print("{:.10f}".format((a + b) / n))

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

print(count/N)

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

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

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

n_odd = 0

def is_even(num):
    if num % 2 == 0:
        return 0
    else:
        return 1
for i in range(1, N+1):
    n_odd += is_even(i)

print(n_odd/N)

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

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

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

Solution (Python):

N=int(input())


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


print(result)

Solution (Python):
import math

n = int(input())
if n % 2 == 0:
    print("{:.10f}".format(0.5))
else:
    print("{:.10f}".format(math.ceil(n / 2.0) / 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())
if n==1:
    print(1)
elif n%2==0:
    print(1/2)
else:
    print((n//2+1)/n)

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

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

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

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

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

Solution (Python):
N = input()
1 <= int(N) <= 100

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

else:
  x = (int(N)+1)/2
  print(float(x/int(N)))

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

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

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

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

ai = [ i for i in range(n+1) if i%2 == 1]
print 1.0 * len(ai) / n

Solution (Python):



input_val = int(input())


odd_cnt = -(-input_val // 2)

print(odd_cnt / input_val)

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

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

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

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

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

else:
	print('{:.10f}'.format(1 / 2))

Solution (Python):
"""
author : halo2halo
date : 18,Oct,2019
"""

import sys
input = sys.stdin.readline

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

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

a = []

for i in range(1,N+1):
  if i % 2 != 0:
    a.append(i)
  else:
    pass

ans = len(a) / N

print(ans)

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

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

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

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

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

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

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

if N % 2 == 0:
    result = 0.5
else:
    result = 1 - N // 2 / N

print(result)

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

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

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

  
print(odd(N))

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