import math as m

def D(i):
    if i==0:
        return(1)
    else:
        return(0)

def d(i,n):
    if i==1:
        if n%6==0:
            return(1)
        else:
            return(0)
    if i>1:
        if n%((i+1)*(i+2))==0:
            return(d(i-1,n)+1)
        else:
            return(d(i-1,n))

def p(n):
    S=0
    for i in range(1,n+1):
        for k in range(2,m.floor(m.sqrt(i))+1):
            S=S+(2*D(d(k,i))+D(d(k,i)-1))*(1-D(d(k-1,i)-1))*d(k,i)
    return(1/6+S/(n))

for i in range(1,10):
    n=2**i
    print(n,p(n))