human
Non Fibonacci Numbers | Returns n 'th Non-Fibonacci number.
curr is to keep track of current fibonacci number , prev is previous , prevPrev is previous of previous ..
While count of non - fibonacci numbers doesn 't become  negative or zero.
Simple Fibonacci number logic.
( curr - prev - 1 ) is count of non - Fibonacci numbers between curr and prev ..
n might be negative now . Make sure it becomes positive by removing last added gap ..
Now add the positive n to previous Fibonacci number to find the n 'th non-fibonacci..
Driver code"
How can the above be solved in Python?
 Give me a code to non Fibonacci Numbers and the other steps required?
assistant
#Here is code to non Fibonacci Numbers and the other steps required.
 def nonFibonacci ( n ) :
	prevPrev = 1
	prev = 2
	curr = 3
	while n > 0 :
		prevPrev = prev
		prev = curr
		curr = prevPrev + prev
		n = n - ( curr - prev - 1 )
	n = n + ( curr - prev - 1 )
	return prev + n
print ( nonFibonacci ( 5 ) )