#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define dcml(x) cout<<fixed<<setprecision(x)
#define F first
#define S second
#define mine(a) *min_element(all(a))
#define maxe(a) *max_element(all(a))
using namespace std;
void yes(){puts("Yes");return;}
void no() {puts("No"); return;}
template <class T> void chmin(T &a,const T &b){a>b?a=b:0;}
template <class T> void chmax(T &a,const T &b){a<b?a=b:0;}
const int inf=0x3fffffff;
const char sp=' ';

int main(){
  int n;
  cin>>n;
  int ans=n*1.08;
  if(ans<206) puts("Yay!");
  else if(ans==206) puts("so-so");
  else puts(":(");
}

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

int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  int mx = 0;
  int mn = 1e9 + 10;
  map<int, int> mp;
  for (int i = 0; i < n; ++i) {
    ++mp[a[i]];
    mx = max(mx, a[i]);
    mn = min(mn, a[i]);
  }
  // cout << mx << endl;
  // cout << mn << endl;
  // for (auto x : mp) {
  //   cout << x.first << " " << x.second << endl;
  // }
  while (true) {
    if (mx == mn) {
      break;
    }
    mp[mx - mn] = mx - mn;
    mp.erase(mx);
    mx = mp.rbegin()->first;
    mn = mp.begin()->first;
    // cout << "mx " << mx << endl;
    // cout << "mn " << mn << endl;
  }
  cout << mx << endl;
}
