#!/usr/bin/env python
# -*- coding: utf-8 -*-

#
# fig04_18.py
# Computes fibonacci using recursion.
#
# Author: Billy Wilson Arante
# Created: 2014/08/11 PHT
#

def fibonacci(n):
	
	if n < 0:
		print "Cannot find the fibonacci of a negative integer"
	
	if n == 0 or n == 1:
		return n

	else:
		return fibonacci(n - 1) + fibonacci(n - 2)
		
def main():
	number = int(raw_input("Enter an integer: "))
	result = fibonacci(number)
	print "Fibonacci(%d) = %d" % (number, result)
	
if __name__ == "__main__":
	main()
