def fact(n):
	if n == 1:
		return 1
	else :
		return n * fact(n-1)
def comp(f):
	return (lambda g : 
		    lambda x: f(g(x)))

comp = (lambda f: 
	(lambda g : 
	 (lambda x: f(g(x))
	  )
	 )
	)

def dec2bin(n):
	a = ""
	while n > 0:
		if n % 2 == 0:
			a = "0" + a
		else: 
			a = "1" + a
		n = n / 2
	return a

def fact2(n):
	a = 1
	while n > 1:
		a = n * a
		n = n - 1
	return a

def isPrimer(n):
	m = 2
	while m < n:
		if ((n % m) == 0):
			return False
		m += 1
	return True

ff = comp(lambda x : x + 1)(fact)

def ho(f):
	return f

if __name__ == "__main__":
	print "Hello World!"
	print fact(10)
	li = [1,2]
	li.extend(li)
	li += li
	a = 1 
	while a < 20:
		print a,isPrimer(a)
		a += 1
	print fact2(4)
	print dec2bin(10)
	#print ff(2)
	"""print comp((lambda x : x * 0), fact)(2)"""