#include <bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
	*this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
// debug & operator << (debug & dd, P p) { dd << "(" << p.x << ", " << p.y << ")"; return dd; }
#define ll long long

vector<int>read_array(int n){
    vector<int>a(n);
    for(int i = 0; i < n; i++)cin >> a[i];
    return a;
}

void test_case(){
    int n;
    cin >> n;
    int tax = (double)1.08 * n;
    if(tax < 206){
        cout << "Yay!" << endl;
    }else if(tax == 206){
        cout << "so-so" << endl;
    }else{
        cout << ":(" << endl;
    }
} 








int main(){    
    test_case();
} 


 

#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solveA() {
	  int n;
        cin>>n;
        int tax=1.08*n;
        if(tax<206) cout<<"Yay!"<<endl;
        else if(tax==206) cout<<"so-so"<<endl;
        else cout<<":("<<endl;
}
ll Nat(ll n) {
	return (n*(n+1))/2;
}
void solveB() {
    ll n;
     cin>>n;
      ll z=n*2;
      ll sq=(ll)sqrt(z);
      while(Nat(sq)<n) {
      	  sq++;
      }
      cout<<sq<<endl;
}
void solveC() {
	int n;
	 cin>>n;
	 unordered_map<ll,ll> mp;
	 ll val,ans=0;
	 for(int i=1; i<=n; i++) {
	 	   cin>>val;
	 	   mp[val]++;
	 	   ans+=(i-mp[val]);
	 }
	 cout<<ans<<endl; 
}
int main() {
    solveA();
    return 0;
}
