import java.util.*;

public class Chapter11Lab1
{
    public static void main(String args[])
    {
        int num2[] = {1,34,2,7,8,7,7,2,2,90};
        sort(num2);
        printnum2(num2);
        randint();
        System.out.println();
        mean(num2);
        median(num2);
        mode(num2);
    }
    //print array
    public static void printnum2(int num2[])
    {
        for(int item: num2)
        {
            System.out.print(item + " ");
        }
        System.out.println();
    }
    //part 1
    public static void randint()
    {
        Scanner input = new Scanner(System.in);
        int index = input.nextInt();
        int num[] = new int[index];
        for(int i = 0; i<num.length; i++)
        {
            int x = (int)(Math.random()*100+1);
            num[i] = x;
            System.out.print(num[i]+ " " );
        }
    }
    //part 2
    public static void mean(int num2[])
    {
        double avg = 0;
        for(int ind = 0; ind<num2.length; ind++)
        {
            avg+=(double)num2[ind];
        }
        avg = avg/num2.length;
        System.out.println("Mean: "+avg);
    }

    //part 3
    public static void median(int num2[])
    {
        int mid;
        int med;
        int even;
        int med2;
        int evenmid;
        if(num2.length%2 == 0)
        {
            mid = num2.length/2;
            med = num2[mid];
            even = mid-1;
            med2 = num2[even];
            evenmid = (med+med2)/2;
            System.out.println("Median: "+evenmid);

        }
        else
        {
            mid = num2.length/2;
            med = num2[mid];
            System.out.println("Median: "+med);
        }
    }

    //part 4
    public static void mode(int num2[])
    {
        int modes[]=new int [num2.length];
        int counter=0;
        int maxcount=2;
        int c=0;
        for(int k=0;k<num2.length;k++)
            modes[k]=-1999;

        for(int i=0;i<num2.length;i++){
            counter=0;
            for(int k=0; k<num2.length;k++){
                if( num2[i]==num2[k])
                    counter++;}
            if( counter>= maxcount) {
                maxcount=counter;
                boolean tf = false;
                for(int j=0; j<num2.length;j++)
                {
                    if(modes[j]==num2[i])
                    {
                        tf=true;
                    }

                }
                if(tf==false)
                {
                    modes[c] = num2[i];
                    c++;
                }
            }
        }
        System.out.print("Mode: ");
        for(int r: modes)
        {
            if (r!=-1999)
            System.out.print(r + " ");
        }
    }

    //sort method
    public static void sort(int intArray[])
    {
        int temp;
        for (int p = 1; p < intArray.length; p++)
            for (int q = 0; q < intArray.length-p; q++)
                if (intArray[q] > intArray[q+1])
                {
                    temp = intArray[q];
                    intArray[q] = intArray[q+1];
                    intArray [q+1] = temp;
                }
    }
}