# Recursive Table of Fibbonacci numbers
# This variation is concise but highly inefficient
# Neal Nelson 2007.10.10

def fib(n):
  if (n == 0): return 0
  elif (n == 1): return 1
  else: return fib(n-1) + fib(n-2)

def fibTable(n):
# print a table of Fibbonacci numbers from 0 to n
  for i in range(n+1):
    print i, fib(i)

def main():
  n = input("Enter a positive integer: ")
  if (n < 0): print "Enter only positive integers"
  else: fibTable(n)

main()