using System;

public class Program

{

    static void MergeSort(int[] arr, int start, int end)

    {

        if(start <= end)

        {

            return;

        }

        int middle = (start + end) / 2;

        MergeSort(arr, start, middle);

        MergeSort(arr, middle + 1, end);

        CompareAndSort(arr, start, middle, end);

    }

    static void CompareAndSort(int[] arr, int start, int middle, int end)

    {

        int[] sortedArr = new int[arr.Length];

        int k = start;

        int i = start;

        int j = middle;

        while(i <= middle &&  j <= end)

        {

            if(arr[i] > arr[j])

            {

                sortedArr[k] = arr[j];

                k++;

                j++;

            }

            else

            {

                sortedArr[k] = arr[j];

                k++;

                i++;

            }

        }

        while(i <= middle)

        {

            sortedArr[k] = arr[i];

            k++;

            i++;

        }

        while(j <= end)

        {

            sortedArr[k] = arr[j];

            k++;

            j++;

        }

        for(int index = start; index <= end ;index++)

        {

            arr[index] = sortedArr[index];

        }

    }

    public static void Main()

    {

        int[] arr = Console.ReadLine().Split(' ').Select(int.Parse).ToArray();

        int k = arr[0];

        int j = arr[];

    }

}