using System;

using System.Collections.Generic;

public class Program

{

    public static void Main()

    {

        // The flag to find permutations from

        int flag = 13;

        // Find the leftmost 1 bit to skip all those leading zeros later

        int firstBit = -1;

        for(int i = 32; i >= 0; i--) {

            if(flag >> i == 1) {

                firstBit = i;

                break;

            }

        }

        //Console.WriteLine(firstBit);

        // Store all the indecies for the zero bits to re-insert into regular counting

        var zeroIndecies = new List<int>();

        for(int i = 0; i < firstBit; i++) {

            if(((flag >> i) & 1) == 0) {

                zeroIndecies.Add(i);

                //Console.WriteLine(i);

            }

        }

        // How many one bits are in the flag

        var numOneBits = (firstBit + 1) - zeroIndecies.Count;

        // The amount of results is equal to 2^numOneBits

        var numResults = (int)Math.Pow(2, numOneBits);

        var output = new uint[numResults - 1];

        // Count from zero to numResults. Insert zero bits where needed

        uint temp = 1;

        for(uint i = 1; i < numResults; i++) {

            temp = i;

            // Insert zero bits

            for(var k = 0; k < zeroIndecies.Count; k++) {

                int bitIndex = zeroIndecies[k];//(int)Math.Pow(2, zeroIndecies[k]);

                if(i >= bitIndex) {

                    uint preChunk = temp & ~(~(uint)0 << bitIndex);

                    temp >>= bitIndex;

                    temp <<= bitIndex + 1;

                    temp |= preChunk;

                }

            }

            // Zero is not a valid permutation

            if(temp == 0) {

                continue;

            }

            output[i - 1] = temp;

        }

        // Print results

        for(var i = 0; i < output.Length; i++) {

            Console.WriteLine(Convert.ToString(output[i], 2).PadLeft(6, '0'));

        }

    }

}