def fib(n)
	if (n == 0) then return 0 end
	if (n == 1) then return 1 end
	fib(n-1) + fib(n-2) if n > 1
end

puts(fib(33))