public static class CollatzConjecture

{

    static int stepCounter = 1;

    public static int Steps(int number)

    {

        if (number == 1)

        {

            return stepCounter;

        }

        else if (number % 2 == 0)

        {

            number = StepForEven(number);

            stepCounter++;

            Steps(number);

        }

        else

        {

            number = StepForOdd(number);

            stepCounter++;

            Steps(number);

        }

        static int StepForEven(int nnumber)

        {

            return nnumber / 2;

        }

​

        static int StepForOdd(int nnumber)

        {

            return 3 * nnumber + 1;

        }

    }

}