using System;

​

public class Calculator

{

    public bool PrimeChecker(int n)

    {

        int c = 0;

        for (int i = 1; i <= n; i++)

        {

            if (n % i == 0)

            {

                c = c + 1;

            }

        }

​

        if (c == 2)

        {

            return true;

        }

        else

        {

            return false;

        }

    }

}

​

public class Program

{

    public static void Main()

    {

        //Q6. Write a Class Calculator. Inside class calculator create a method PrimeChecker which returns a bool value.

        //PrimeChecker has one int parameter. 

        //  It checks if the input parameter is prime or not and returns true if its prime otherwise returns false. 

        //In main method, declare an int array. Allow user to input the size of array, and the numbers into the array. 

        //Use the method PrimeChecker to check if the numbers stored in the array are prime or not and count the number of prime numbers and display the count.

        Calculator ob = new Calculator();

        Console.WriteLine("Enter the size of the array:");

        int p = Int32.Parse(Console.ReadLine());

        int[] array = new int[p];

        Console.WriteLine("Enter the elements of the array:");

        for (int i = 0; i < p; i++)

        {

            array[i] = Int32.Parse(Console.ReadLine());

        }

​

        bool j;

        int s = 0;

        for (int i = 0; i < p; i++)

        {

            j = ob.PrimeChecker(array[i]);

            if (j == true)

            {

                s++;

            }

​

            Console.WriteLine(j);

        }

​

        Console.WriteLine("Count of Prime Numbers=" + s);

    }

}