Gray Code

easy

1. The gray code is a binary numeral system where two successive numbers differ in only one bit.
2. Given a non-negative integer n representing the total number of bits in the code, print the 
     sequence of gray code. A gray code sequence must begin with 0.
 
 Example:
 Input: 2
 Output: [0,1,3,2]
 Explanation:
 00 - 0
 01 - 1
 11 - 3
 10 - 2
 [0,2,3,1] is also a valid gray code sequence.
 00 - 0
 10 - 2
 11 - 3
 01 - 1

Input Format

First line contains n(number of digits).

Output Format

Return the list of numbers in any valid order.

Constraints

0&lt;=n&lt;=20

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

Output

[0, 1, 2, 3]

Basics Of Bit Manipulation

Related Questions

easy Basics Of Bit Manipulation easy Print Value Of Rsb Mask easy Kernighans Algorithm easy All Repeating Except One easy All Repeating Except Two easy All Repeating Three Times Except One easy One Repeating And One Missing easy Flip Bits To Convert A To B easy Copy Set Bits In A Range easy Check Divisibility By 3 easy Print Binary And Reverse Bits easy Count Set Bits In First N Natural Numbers easy Is A Power Of 2 easy Solve 7n By 8 easy Swap All Odd And Even Bits easy Sum Of Bit Differences Of All Pairs