#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(),(x).end()
#define COUT(x) cout<<(x)<<"\n"
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define REP(i, n) for(int i=0;i<n;i++)
#define YES(x) cout<<(x?"YES":"NO")<<"\n"
#define Yes(x) cout<<(x?"Yes":"No")<<"\n"
#define dump(x) cout<<#x<<" = "<<(x)<<"\n"
#define endl "\n"
using G = vector<vector<int>>;
using M = map<int,int>;
using P = pair<int,int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int,vector<int>,greater<int>>;
using V = vector<int>;
using ll = long long;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;

int main() {
  IOS;
  int n=5;
  int d[n],k;
  REP(i,5) cin >> d[i];
  cin >> k;

  REP(i,n) {
    REP(j,n) {
      if (i == j) continue;
      if (abs(d[i]-d[j]) > k) { COUT(":("); return 0; }
    }
  }
  COUT("Yay!");
  return 0;
}
#include <bits/stdc++.h>
using namespace std;
int main() {
  int A, B, C, D, E, X;
  cin >> A >> B >> C >> D >> E >> X;
  int ma, mi;
  ma = max(max(max(max(A, B), C), D), E);
  mi = min(min(min(min(A, B), C), D), E);
  if(ma - mi > X) {
    cout << ":(" << endl;
  }
  else {
    cout << "Yay!" << endl;
  }
}