03. FitTree (6 Dec 2011 Morning)

using System;



class FitTree
{
    static void Main()
    {
        int digits = int.Parse(Console.ReadLine());
        int numberP = 0;
        int count = 0;

        for (int k = 0; k < digits; k++)
        {

            int invertedP = 0;
            int reversedP = 0;
            numberP = int.Parse(Console.ReadLine());
            for (count = 0; count < 32; count++)
            {
                int mask = 1 << count;
                if (mask > numberP || count == 31)
                {
                    count--;
                    break;
                }
            }

            for (int i = 0, j = count; i <= count; i++, j--)
            {
                int mask = 1 << i;
                int bit = numberP & mask;

                int invertedMask = 1 << j;

                if (bit == 0)
                {
                    invertedP = invertedP | mask;
                    reversedP = reversedP & ~invertedMask;
                }
                else
                {
                    invertedP = invertedP & ~mask;
                    reversedP = reversedP | invertedMask;
                }
            }
            Console.WriteLine((numberP ^ invertedP) & reversedP);
        }

    }
}