#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PII array<int,2>
#define PI3 array<int,3>

const ll N = 1e5 + 5, mod = 998244353, INF = 1e9;

ll a[21], dp[21][1<<21];
vector<int> b[1<<21];

inline void update(ll &x, ll y) {
	if(x < y) x = y;
}

void solve() {
	int n; cin >> n; int m = 1 << n;
	for(int i = 0; i < n; ++ i)cin >> a[i];
	ll x; cin >> x;
	
	for(int i=m-1; i; i--) {
		for(int j=0; j<n; j++) if(i>>j&1) b[i].emplace_back(j);
	}
	
	for(int sta = 1, lst_sta; sta < m; ++ sta){
		for(auto const &i: b[sta]) {
			lst_sta = sta ^ (1 << i);
			if(lst_sta == 0){
				dp[i][sta] = x % a[i];
				break;
			}else{
				for(auto const &j: b[lst_sta]) {
					if(n < 15)
						update(dp[i][sta], dp[j][lst_sta] >= a[i] ? dp[j][lst_sta] % a[i] : dp[j][lst_sta]);
				}
			}
		}
	}
	
	ll ans = 0;
	for(int i=0; i<n; i++) ans = max(ans, dp[i][m-1]);
	cout << ans;
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	
	int t = 1; //cin >> t;
	while(t --) solve();
	return 0;
}