using System;

using System.Numerics;

public class Program

{

    public static void Main()

    {

        // This creates the variable that allows the BitspaceCruncher class to expose its features onto the main program.

        var bitspacecruncher = new BitspaceCruncher();

        // Executes the foreign class' methods in the main program.

        bitspacecruncher.Input();

        Console.WriteLine("");

        bitspacecruncher.Cruncher();

    }

}

​

// This class features the input method Input(), as well as the calculation method Cruncher().

public class BitspaceCruncher

{

    BigInteger x = 0;

    BigInteger bits = 1;

    BigInteger states = 1;

    public void Input()

    {

        Console.WriteLine("Enter the numbers of integer bits below, and I will calculate the numbers of non-degenerate states allowed in the bitspace below: ");

        String Reject = Console.ReadLine();

​

        // This loop rejects all inputs that are not integers

        while(!BigInteger.TryParse(Reject, out x))

        {

            Console.WriteLine("Not an integer, try again.");

​

            Reject = Console.ReadLine();

        }

    }

    // I had to resort to looping in this particular method, rather than using the Math.Pow command, since I didn't have enough time to figure

    // out how to properly implement exponents from Math. As one of my favorite developers, Gavin Andresen, once said:

    // "Let not perfect be the enemy of the good."

    public void Cruncher()

    {

        do

        {

            states = 2 * states;

            Console.WriteLine("{0}-bit bitspace has {1} non-degenerative states.", bits, states);

            bits += 1;      

        }

        while (bits <= x);

    }

}

​