using System;

using System.Collections.Generic;

public class Program

{

    List<int> list = new List<int>();

    public static void Main()

    {

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

        int[] a = new int[n];

        for(int a_i = 0; a_i < n; a_i++){

           a[a_i] = Convert.ToInt32(Console.ReadLine());   

        }

        quicksort(a, 0, n-1);

        Console.WriteLine(n/2);

        double median;

        if(n % 2 == 1){

            median = a[n/2];

        }else{

            median = (a[n/2] + a[n/2 - 1]) / (2.0); 

        }

        Console.WriteLine("median is " + median);

    }

    public static void quicksort(int[] arr, int left, int right){

        if(left < right){

            int pivot = partition(arr, left, right);

            if(pivot > 1){

                quicksort(arr, left, pivot -1); 

            }

            if(pivot + 1 < right){

                quicksort(arr, pivot +1, right);    

            }

        }

    }

    public static int partition(int[] arr, int left, int right){

        int pivot = arr[left];

        while(true){

            while(arr[left] < pivot){

                left ++;    

            }

            while(arr[right] > pivot){

                right--;    

            }

            if(left < right){

                int temp = arr[right];

                arr[right] = arr[left];

                arr[left]= temp;

            }else{

                return right;   

            }

        }

    }

}