#include<stdio.h>
void sort(int *arr, int size) {
    for(int i = 0; i < size -1; i++) {
        for(int j = i + 1; j < size; j++) {
            if(*(arr + j) < *(arr + i)) {
                int temp = *(arr + i);
                    *(arr + i) = *(arr + i);
                    *(arr + j) = temp;
                
            }
        }
    }
}
int main() {
    int n1,n2;
    scanf("%d", &n1);
    if(n1 <= 0) {
        printf("Invalid input");
        return 0;
    }
    int arr1[n1];
    for(int i = 0; i <n1; i++)
        scanf("%d", &n2);
        
    if(n2 <= 0) {
        printf("Invalid input");
        return 0;
    }   
    int arr2[n2];
    for(int i = 0; i < n2; i++)
        scanf("%d", &arr2[i]);
    int merged[n1 + n2];
    
    for(int i = 0; i < n1; i++)
    merged[i] = arr1[i];
    
    for(int i = 0; i < n2; i++)
        merged[n1 + i] = arr2[i];
        
    sort(merged, n1 + n2);
    for(int i = 0; i < n1 + n2; i++)
        printf("%d ", merged[i]);
        
        return 0;
}
    
    
    
    
    
    
    for(int i = 0; i < n2; i++)
        merged[n1 + i] = arr2[i];
        
    sort(merged, n1 + n2);
    for(int i = 0; i < n1 + n2; i++)
    printf("%d ", merged[i]);
    
    return 0;
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
}