#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>

typedef long long int ll;
using namespace std;
#define INF 1234567890
#define N 200000

const int LIMIT = 1e+9;
int n, m;
ll value[10000];


int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> n;
	ll max_value = 0, sum = 0;
	for (ll i = 0; i < n; i++) {
		cin >> value[i];
		max_value = max(max_value, value[i]);
		sum += value[i];
	}
	cin >> m;
	if (m >= sum) {
		cout << max_value;
		return 0;
	}
	ll left = 0, right = 1000000001;
	while (left < right) {
		ll mid = (left + right) / 2;
		ll tmp = 0;
		for (int i = 0; i < n; i++) {
			if (mid >= value[i]) {
				tmp += value[i];
			}
			else {
				tmp += mid;
			}
		}
		if (tmp <= m) {
			left = mid + 1;
		}
		else {
			right = mid;
		}
	}

	cout << left - 1;

	return 0;
}