print "hello"   ## The main idea of the program is to produce three ends:
                ## The first of which is to identify one bit like relation
                ## furthest from that of any closed relation
                ## The second of which is to embedd the five operations back
                ## within that of the given structure of logical presumption
                ## The third of which is to admit a closed relation for that
                ## of recursive limitation of nonexception unto opening.
   
pas = 0
arg = 0
i = 0
j = 1
k = 0
l = 0
m = 0
arg1 = 1
arg2 = 0
arg3 = 1
arg4 = 1
arg5 = 0
arg6 = 1
    
surface = 20
ending = 15
mixture = 12
returnone = 10


def closure(j, arg, ending):
    ending = ending*pas
    j -= arg*ending
    return j*(j-1)

def opening(i, j, arg, surface):
    surface = surface*closure(j, arg, ending)
    i += arg*surface
    return i*i

def miscibility(i, j, k, l, m, argone, argtwo, surface, mixture):
    mixture = mixture*opening(i, j, argone, surface)
    k = argone - argtwo
    l = argone
    m += l+k*mixture
    return m
    
def escape(j, i, k, l, m, arg, bim, surf, returnone):
    returnone = returnone*miscibility(i, j ,k, l, m, bim, arg, surf, closure(j, arg, ending))
    returnone = (1-bim)*returnone
    return returnone*arg-bim

class knucle(pas, arg):
    i = 0
    j = 1
    k = 0
    l = 0
    m = 0

    arg1 = 1
    arg2 = 0
    arg3 = 1
    arg4 = 1
    arg5 = 0
    arg6 = 1
    
    surface = 20
    ending = 15
    mixture = 12
    returnone = 10

    print opening(i, j, arg1, surface)
    print closure(j, arg2, ending)
    print miscibility(i, j, k, l, m, arg3, arg4, surface, mixture)
    print escape(j, i, k, l, m, arg5, arg6, surface, returnone)
   
passing = 16
argument = 10

instance = knucle(passing, argument)