#include<stdio.h>
#include<stdlib.h>
/*
void printarr(int a[],int n)
{
    for(int i=0;i<n;i++)
    {
        printf("%d ",a[i]);
    }
}


int main()
{
    printf("Enter n: ");
    int n;
    scanf("%d",&n);
    printf("List: ");
    int a[n];
    int cnt_comp=0,cnt_ex=0;
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }

    for(int i=1;i<n;i++)
    {
        int key=a[i];
        int j=i-1;
        while(j>=0 && a[j]>key)
        {
            a[j+1]=a[j];
            j--;
            cnt_comp++;
            cnt_ex++;
        }
        cnt_comp++;
        a[j+1]=key;
    }

    printarr(a,n);
    printf("\n");
    printf("Number of comparison: %d\n",cnt_comp);
    printf("Number of exchange: %d",cnt_ex);

}
*/
/*
void printarr(int a[],int n)
{
    for(int i=0;i<n;i++)
    {
        printf("%d ",a[i]);
    }
}
int main()
{
    printf("Enter n: ");
    int n;
    scanf("%d",&n);
    printf("List: ");
    int a[n];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }

    for(int i=0;i<n;i++)
    {
        for(int j=1;j<n;j++)
        {
            if(a[j-1]>a[j])
            {
                int tmp=a[j-1];
                a[j-1]=a[j];
                a[j]=tmp;
            }
        }

    }

    printarr(a,n);

}
*/


void printarr(int a[],int n)
{
    for(int i=0;i<n;i++)
    {
        printf("%d ",a[i]);
    }
}
int main()
{
    printf("Enter n: ");
    int n;
    scanf("%d",&n);
    printf("List: ");
    int a[n];
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }for(int i=0;i<n;i++)
    {
        int min=a[i];
        int idx=i;
        for(int j=1;j<n;j++)
        {
            if(a[j]<min)
            {
                min=a[j];
                idx=j;
            }
        }

        int tmp=a[i];
        a[i]=min;
        a[idx]=tmp;

    }

    for(int i=0;i<n;i++)
    {
        int min=a[i];
        int idx=i;
        for(int j=i+1;j<n;j++)
        {
            if(a[j]<min)
            {
                min=a[j];
                idx=j;
            }
        }

        int tmp=a[i];
        a[i]=min;
        a[idx]=tmp;

    }
    int sum=0;
    for(int i=0;i<n;i++)
    {
        sum+=a[i];
    }

    printf("Mean: %.2f\n",(float)sum/n);

    if(n&1) printf("Median: %d",a[n/2]);
    else printf("Median: %.1f",(a[n/2]+a[(n/2)-1])/2.0);

}




















/*
#include <stdio.h>

void insertionSort(int arr[], int n) {
    int i, key, j;

    for (i = 1; i < n; i++) {
        key = arr[i];
        j = i - 1;

        // Move elements greater than key
        // one position ahead
        while (j >= 0 && arr[j] > key) {
            arr[j + 1] = arr[j];
            j--;
        }

        arr[j + 1] = key;
    }
}

void printArray(int arr[], int n) {
    for (int i = 0; i < n; i++)
        printf("%d ", arr[i]);
    printf("\n");
}

int main() {
    int arr[] = {12, 11, 13, 5, 6};
    int n = sizeof(arr) / sizeof(arr[0]);

    printf("Original array: ");
    printArray(arr, n);

    insertionSort(arr, n);

    printf("Sorted array: ");
    printArray(arr, n);

    return 0;
}
*/