//Question 1
#include <stdio.h>

void merge(int [], int, int [], int, int []);

int main() {
  int a[100], b[100], m, n, c, sorted[200];

  //Input number of elements in first array
  scanf("%d", &m);


  for (c = 0; c < m; c++) {
    scanf("%d", &a[c]);
  }

  //Input number of elements in second array
  scanf("%d", &n);


  for (c = 0; c < n; c++) {
    scanf("%d", &b[c]);
  }

  merge(a, m, b, n, sorted);

  //print Sorted array

  for (c = 0; c < m + n; c++) {
    printf("%d ", sorted[c]);
  }

  return 0;
}

void merge(int a[], int m, int b[], int n, int sorted[]) {
  int i, j, k;

  j = k = 0;

  for (i = 0; i < m + n;) {
    if (j < m && k < n) {
      if (a[j] < b[k]) {
        sorted[i] = a[j];
        j++;
      }
      else {
        sorted[i] = b[k];
        k++;
      }
      i++;
    }
    else if (j == m) {
      for (; i < m + n;) {
        sorted[i] = b[k];
        k++;
        i++;
      }
    }
    else {
      for (; i < m + n;) {
        sorted[i] = a[j];
        j++;
        i++;
      }
    }
  }
}

//Question 2
#include <stdio.h>

int main()
{
    int n, i;
    float num[100], sum = 0.0, average;


    scanf("%d", &n);

    //calculate sum
    for(i = 0; i < n; ++i)
    {

        scanf(" %f", &num[i]);
        sum += num[i];
    }
    //average
    average = sum / n;
    printf("%.2f", average);

    return 0;
}


//Question 3
#include <stdio.h>

int main()
{
    int i, n;
    float arr[100];


    scanf("%d", &n);


    // Stores number entered by the user
    for(i = 0; i < n; ++i)
    {

       scanf(" %f", &arr[i]);
    }

    // Loop to store largest number to arr[0]
    for(i = 1; i < n; ++i)
    {
       // Change < to > if you want to find the smallest element
       if(arr[0] < arr[i])
           arr[0] = arr[i];
    }
    printf("%.2f", arr[0]);

    return 0;
}

//Question 4
#include <stdio.h>
#include <math.h>

float calculateSD(float data[]);

int main()
{
    int i;
    float data[100];

    scanf("%d",&n);
    for(i=0; i < n; ++i)
        scanf("%f", &data[i]);

    printf("\n%.6f", calculateSD(data,n));

    return 0;
}

float calculateSD(float data[],int n)
{
    float sum = 0.0, mean, standardDeviation = 0.0;

    int i;

    //calculate sum
    for(i=0; i<n; ++i)
    {
        sum += data[i];
    }

    //calculate average
    mean = sum/n;

    //calculate SD
    for(i=0; i<n; ++i)
        standardDeviation += pow(data[i] - mean, 2);

    return sqrt(standardDeviation/n);
}

//Question 5
    /*int arr[100];
    int i=0, j=0, temp=0, n=0;

    scanf("%d",&n);

    for(i=0 ; i<n ; i++)
    {
        scanf("%d",(arr+i));
    }

 //sort array
    for(i=0 ; i<n ; i++)
    {
        for(j=0 ; j<n-1 ; j++)
        {
            if(*(arr+j)<*(arr+j+1))
            {
                temp        = *(arr+j);           //sort array
                *(arr+j)    = *(arr+j+1);
                *(arr+j+1)  = temp;
            }
        }
    }
    for(i=0;i<n;i++)
    printf("%d ",*(arr+i));
    return 0;
}


//Question 6
    int arr[100];
    int i=0, j=0, temp=0, n=0;
    float median;

    scanf("%d",&n);

    for(i=0 ; i<n ; i++)
    {
        scanf("%d",(arr+i));
    }

  //sort array
    for(i=0 ; i<n ; i++)
    {
        for(j=0 ; j<n-1 ; j++)
        {
            if(*(arr+j)>*(arr+j+1))
            {
                temp        = *(arr+j);
                *(arr+j)    = *(arr+j+1);
                *(arr+j+1)  = temp;
            }
        }
    }
    // if number of elements are even
    if(n%2 == 0)
        median = (*(arr+((n-1)/2)) + *(arr+(n/2)))/2.0;
    // if number of elements are odd
    else
        median = *(arr+(n/2));


        printf("%.2f",median);

   return 0;
}