#include <iostream>
#include <algorithm>
using namespace std;
int findmin(int *arr,int l,int r) {
//当分到还有一个元素时返回这个元素的值
if (l >= r)return arr[r];
int mid = (l + r) / 2;
//判断返回的两个值的大小
return min(findmin(arr, l, mid), findmin(arr, mid + 1, r));
}
//同上
int findmax(int* arr, int l, int r) {
if (l >= r)return arr[r];
int mid = (l + r) / 2;
return max(findmax(arr, l, mid), findmax(arr, mid + 1, r));
}
int main() {
int n = 0;
cin >> n;
int* arr = (int*)malloc(sizeof(int)*n);
for (int i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
cout<<"最大元素:"<< findmax(arr, 0, n - 1) << endl;
cout << "最小元素:" << findmin(arr, 0, n - 1);
return 0;
}