Given a positive integer n. The problem is to check if the number is Fibbinary Number or not. Fibbinary are integers whose representation contains no ones.

```Input : 10
Output : Yes
Explanation: 1010 is the binary representation
of 10 which does not contains any
consecutive 1's.

Input : 11
Output : No
Explanation: 1011 is the binary representation
of 11, which contains consecutive
1's.
```

: If (n & (n >> 1)) == 0, then ‘n’ is a fibbinary number Else not.

```// C++ implementation to check whether a number
// is fibbinary or not
#include <bits/stdc++.h>
using namespace std;

// function to check whether a number
// is fibbinary or not
bool isFibbinaryNum(unsigned int n) {

// if the number does not contain adjacent ones
// then (n & (n >> 1)) operation results to 0
if ((n & (n >> 1)) == 0)
return true;

// not a fibbinary number
return false;
}

// Driver program to test above
int main() {
unsigned int n = 10;
if (isFibbinaryNum(n))
cout << "Yes";
else
cout << "No";
return 0;
}
```

Output:

```Yes
```

Complexity: O(1).

If you like GeeksforGeeks and would like to contribute, you can also write an using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.