using System;

namespace MyCompiler {
    class Program {
        public static void Main(string[] args) {
            Console.WriteLine("Hello world!");
            
            //--My code--//
            //Concerncs --> this will run the loop for even numbers as well
            //To avoid that check whether it is divisble for 2.
            int primeNumber = 4;
            if(primeNumber == 1 ){
                Console.WriteLine("Number is prime: {0}",primeNumber);
            }
            int n = primeNumber;
            bool flag = false;
            while(n != 1){
                if(n-- % primeNumber == 0){
                    Console.WriteLine("Number is Not prime");
                    flag = true;
                    break;
                }
                Console.WriteLine("Value of n {0}", n);
            }
            if(!flag){
                Console.WriteLine("Number is prime {0}", primeNumber);
            }
            //Better way
            if (FindPrime(48))  
            {  
                Console.WriteLine("Prime");  
            }  
            else  
            {  
                Console.WriteLine("Not Prime");  
                
            }  
            //end
        }
    
        internal static bool FindPrime(int number)  
        {  
              if (number == 1) return false;  
              if (number == 2) return true;  
              if (number % 2 == 0) return false;  
          
              var squareRoot = (int)Math.Floor(Math.Sqrt(number));  
          
              for (int i = 3; i <= squareRoot; i += 2)  
              {  
                  if (number % i == 0) return false;  
              }  
          
              return true;  
        }
    }
}