namespace CSharp_fudamentalsConsoleApp1
{
    internal class Program
    {
        static void Main(string[] args)


        {
            #region 1


            //int minnumber;
            //int[] array = new int[10];
            //for (int i = 0; i < 10; i++)
            //{
            //    array[i] = int.Parse(Console.ReadLine());
            //}
            //minnumber = array[0];
            //for (int i = 0; i < 10; i++)
            //{
            //    if (array[i] < minnumber)
            //    {
            //        minnumber = array[i];
            //    }
            //}
            //Console.WriteLine("The minimum number is: " + minnumber);

            #endregion
            #region 2
            //char[] arr = new char[] { 'a', 'e', 'i', 'o', 'u' };
            //char ch = char.Parse(Console.ReadLine());
            //bool isVowel = false;
            //for (int i = 0; i < 5; i++)
            //{
            //    if (ch == arr[i])
            //    {
            //        isVowel = true;
            //        break;
            //    }
            //}
            //if (isVowel)
            //{
            //    Console.WriteLine(" vowel");
            //}
            //else
            //{
            //    Console.WriteLine(" consonant");
            //}
            #endregion
            #region 3
            //int n = int.Parse(Console.ReadLine());
            //for (int i = 0; i <= n; i++)
            //{
            //    Console.WriteLine($"{i}*{n} ={i * n}");
            //}
            #endregion
            #region 4
            //int num = int.Parse(Console.ReadLine());
            //if (num % 3 == 0 && num % 4 == 0)
            //{
            //    Console.WriteLine("yes");
            //}
            //else
            //{
            //    Console.WriteLine("No");
            //}
            #endregion
            #region 5
            //int decimalNumber = Convert.ToInt32(Console.ReadLine());

            //string binary = ConvertToBinary(decimalNumber);

            //Console.WriteLine($"Binary representation: {binary}");
            #endregion
            #region 6
            //int size = Convert.ToInt32(Console.ReadLine());

            //int[] array1 = new int[size];
            //int[] array2 = new int[size];

            //Console.WriteLine("Enter elements of first sorted array:");
            //for (int i = 0; i < size; i++)
            //{
            //    array1[i] = Convert.ToInt32(Console.ReadLine());
            //}

            //Console.WriteLine("Enter elements of second sorted array:");
            //for (int i = 0; i < size; i++)
            //{
            //    array2[i] = Convert.ToInt32(Console.ReadLine());
            //}

            //int[] mergedArray = MergeSortedArrays(array1, array2, size);

            //Console.WriteLine("Merged sorted array:");
            //foreach (int num in mergedArray)
            //{
            //    Console.Write(num + " ");
            //}
            #endregion
            #region 7
            //int size = int.Parse(Console.ReadLine());
            //Stack<int> stack = new Stack<int>();
            //for (int i = 0; i < size; i++)
            //{
            //    stack.Push(int.Parse(Console.ReadLine()));
            //}
            //int[] arr=new int[size];
            //for (int i = 0; i < size; i++)
            //{
            //    arr[i] = stack.Pop();
            //}
            //for (int i = 0; i < size; i++)
            //{
            //    Console.WriteLine(arr[i]);
            //}

            #endregion
        }
        static string ConvertToBinary(int num)
        {
            if (num == 0)
                return "0";

            string binary = "";
            while (num > 0)
            {
                binary = (num % 2) + binary; 
                num /= 2;
            }
            return binary;
        }
        static int[] MergeSortedArrays(int[] arr1, int[] arr2, int size)
        {
            int[] merged = new int[size * 2];
            int i = 0, j = 0, k = 0;

            while (i < size && j < size)
            {
                if (arr1[i] < arr2[j])
                    merged[k++] = arr1[i++];
                else
                    merged[k++] = arr2[j++];
            }

            while (i < size)
                merged[k++] = arr1[i++];

            while (j < size)
                merged[k++] = arr2[j++];

            return merged;
        }
    }
}