n个蚂蚁每秒一cm在长度为L的细杆上爬行，蚂蚁相遇反向爬回，知道每只蚂蚁距离左端点距离，求时间最长和最短

//n只蚂蚁，每秒一cm的速度在长度为Lcm的杆上爬行，当爬到杆的一端就会掉落，蚂蚁交错反向，知道到左边的距离，求最长最短时间
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
	int n;
	cin >> n;
	int* p = new int[n+1];
	p++;
	for (int i = 0; i < n; i++)
	{
		cin >> *(p + i);
	}
	int L;
	cin >> L;

	int DISTANCE = 0;
	for (int i = 0; i < n; i++)
	{
		DISTANCE=max(DISTANCE, min(*(p + i), L - *(p + i)));
	}
	double Tmin = DISTANCE / 1.0;
	cout << Tmin<<endl;
	 DISTANCE = 0;
	for (int i = 0; i < n; i++)
	{
		DISTANCE = max(DISTANCE, max(*(p + i), L - *(p + i)));
	}
	double tmax = DISTANCE / 1.0;
	cout <<tmax<<endl;
	
}