Dijkstra task solution

Dijkstra.cs

using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Dkstra
{
    class Program
    {
        static void Main(string[] args)
        {
            for (int i = 1; i < 100; i++)
            {
                Debug.Assert(F(i) == Solution(i));
                Console.WriteLine($"F({i})={F(i)}, Solution({i})={Solution(i)}");

            }
            Console.ReadKey();
        }

        static int F(int n) {
            if (n == 1)
            {
                return 1;
            }
            if ((n % 2) == 0)
            {
                return F(n / 2);
            }
            return F(n / 2) + F(n / 2 + 1);
        }

        static int Solution(int n)
        {
            var count1 = 1;
            var count2 = 0;
            while (n != 1)
            {
                if (n % 2 != 0) count2 = count2 + count1; 
                else count1 = count1 + count2;
                n = n / 2;
            }
            return count1 + count2;
        }
    }
}