maxmin

#include<iostream>
using namespace std;

main(){
    int n, a[100005];
    cin>>n;
    for(int i = 0; i < n; i++) cin>>a[i];
    //sap xep lai mang su dung bubble sort
    for(int i = 0; i < n-1; i++){
        for(int j = i + 1; j < n; j++){
            if(a[i] > a[j]){
                int tmp = a[i];
                a[i] = a[j];
                a[j] = tmp;
            }
        }
    }
    //phan tu dau tien a[0] la phan tu nho nhat, a[n-1] la lon nhat
    cout<<a[n-1]<<endl<<a[0];
}