#pragma GCC optimize("Ofast")  
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define int long long 
#define endl "\n"
#define all(x) (x).begin(),(x).end()
const int MOD = 1e9+7;
const int mxN = 2e5+3;

void solve(){
	int n;
	cin >> n;
	int a[n];
	for(int i = 0; i < n; ++i)cin >> a[i];
	int ans = 0;
	for(int i = 1; i < n; ++i){
		if(a[i] < a[i - 1]){
			ans += (a[i - 1] - a[i]);
			a[i] = a[i - 1];
		}
	}
	cout << ans << endl;
}

int32_t main(){
	IO;
	
	int nT = 1;
	//cin >> nT;
	for(int i = 1; i <= nT; ++i)
		solve();
	return 0;
}

#include <bits/stdc++.h>
using namespace std;

signed main() {
    int a[5], k;
    
    for ( int i = 0; i < 5; i++ ) {
        cin >> a[i];
    }
    cin >> k;
    sort(a, a + 5);
    
    cout << (a[4] - a[0] > k ? ":(\n" : "Yay!\n");
    return (0);
}