Beautiful Binary String

/*
 Alice has a binary string,B , of length n. She thinks a binary string is beautiful if and only if it doesn't contain the
 substring "010".
In one step, Alice can change a 0 to a 1  (or vice-versa). Count and print the minimum number of steps needed to
make Alice see the string as beautiful.
Input Format
The first line contains an integer,n  (the length of binary string B).
The second line contains a single binary string, B, of length n.
Constraints
1<=n<=100
Each character in B belongs to {0,1} .
Output Format
Print the minimum number of steps needed to make the string beautiful.
Sample Input 0
7
0101010
Sample Output 0
2
Sample Input 1
5
01100
Sample Output 1
0
Sample Input 2
10
0100101010
Sample Output 2
3
Explanation
Sample Case 0:
In this sample, B="0101010"
The figure below shows a way to get rid of each instance of "010":


Because we were able to make the string beautiful by changing 2 characters (B2 and B5), we print 2.
Sample Case 1:
In this sample B="01100"
The substring "010" does not occur in B, so the string is already beautiful and we print 0.

 */

using System;

namespace HackerDemo

{

    class BeautifulBinaryString

    {

        public void BeautifulBinaryStringMain()

        {

            int n = Convert.ToInt32(Console.ReadLine());

            string b = Console.ReadLine();

            Console.WriteLine(GetCount(n,b));

        }

        public int GetCount(int n, string Bstr)

        {

            int count = 0;

            string str = "010";

            for (int i = 0; i < n- str.Length+1; i++)

            {

                if (str== Bstr.Substring(i,str.Length))

                {

                    count++;

                    i = i + str.Length-1;

                }

                

            }

            return count;

        }

    }

}