human
Fibbinary Numbers ( No consecutive 1 s in binary ) | function to check whether a number is fibbinary or not.
if the number does not contain adjacent ones then ( n & ( n >> 1 ) ) operation results to 0.
Not a fibbinary number.
Driver code"
How can the above be solved in Python?
assistant
#Here is code to fibbinary Numbers ( No consecutive 1 s in binary ) and the other steps required.
 def isFibbinaryNum ( n ) :
	if ( ( n & ( n >> 1 ) ) == 0 ) :
		return 1
	return 0
n = 10
if ( isFibbinaryNum ( n ) ) :
	print ( " Yes " )
else :
	print ( " No " )