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

int main(){
  int n; cin >> n;
  int ans = n*108;
  ans = ans/100;
  if(ans<206) cout << "Yay!" << endl;
  if(ans==206) cout << "so-so"<<endl;
  if(ans>206) cout << ":(" << endl;
  return 0;
}
#include <bits/stdc++.h>
using namespace std;

#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for(int i = (int)(a); i <= (int)(b); ++i)
#define FORR(i, a, b) for(int i = (int)(a); i >= (int)(b); --i)
#define ALL(c) (c).begin(), (c).end()

using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VD = vector<double>;
using VII = vector<VI>;
using VLL = vector<VL>;
using VDD = vector<VD>;
using P = pair<int, int>;
using PL = pair<ll, ll>;

template <typename T>
bool chmax(T& a, const T& b) {
  if(a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T& a, const T& b) {
  if(a > b) {
    a = b;
    return true;
  }
  return false;
}

void solve(long long N) {
  ll tmp = double(N) * 1.08;
  ll price = 206;
  string ans;
  if(tmp > price) ans = ":(";
  if(tmp == price) ans = "so-so";
  if(tmp < price) ans = "Yay!";
  cout << ans << endl;
}

int main() {
  long long N;
  std::scanf("%lld", &N);
  solve(N);
  return 0;
}
