




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

/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;

typedef tree<long long, null_type, less<long long>, rb_tree_tag,
          tree_order_statistics_node_update>
 is;*/


#define fb find_by_order
#define ok order_of_key

#define mem(x,y) memset(x,y,sizeof x)

typedef long long ll;
typedef int ii;

typedef pair<ll,ll> pi;
typedef vector<pi> vii;

#define map unordered_map

#define INF 1000000000000007
#define pi 3.141592654

#define T while(t--)
#define for2(i,a,b) for(i=a;i>=b;i--)
#define for3(i,a,b) for(i=a;i<=b;i=i+2)
#define for1(i,a,b) for(i=a;i<=b;i=i+1)
#define for4(i,a,b) for(i=a;i>=b;i=i-2)

#define pb push_back
#define pf push_front
#define mp make_pair

#define ff first
#define ss second

#define si set<ll>
#define se multiset<ll>

typedef double ld;
typedef vector<ll> vi;

#define all(v) sort(v.begin(),v.end())
#define all1(v) sort(v.rbegin(),v.rend())

#define pff(uuv) printf("%lld\n",uuv)

#define pf1(uu) printf("%.20Lf\n",uu)

bool comp(pair<ll,char> aa, pair<ll,char> bb) {
    if (aa.ff != bb.ff) return aa.ff > bb.ff;
    return aa.ss < bb.ss;
}
bool comp1(pair<ll,char> aa, pair<ll,char> bb) {
    if (aa.ff != bb.ff) return aa.ff < bb.ff;
    return aa.ss > bb.ss;
}
bool comp2(pair<ll,ll> aa, pair<ll,ll> bb) {
    if (aa.ff != bb.ff) return aa.ff > bb.ff;
    return aa.ss < bb.ss;
}
bool comp3(pair<ll,ll> aa, pair<ll,ll> bb) {
    if (aa.ff != bb.ff) return aa.ff < bb.ff;
    return aa.ss > bb.ss;
}

ll rup(ll ik,ll ikk){

 if(ik%ikk==0) return ik/ikk;
 else return (ik/ikk)+1;

}
ll gcd(ll a,ll b){
 if(b==0) return a;

 return gcd(b,a%b);
 
 
}
ll lcm(ll a ,ll b){

 return (a*b)/gcd(a,b);


}

 

ii main(){
 
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll t=1;
    //cin>>t;
    while(t--){
        ld n;
        cin>>n;
        n*=1.08;
         
        n=ll(n);
        
        if(n<206) cout<<"Yay!\n";
        else if(n==206) cout<<"so-so\n";
        else cout<<":(\n";
        
        
        
        
        
        
            
        
     }
  
      

}

#include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <array>
#include <queue>
#include <stack>
#include <map>
#include <set>

using namespace std;

int main()
{
  int N;
  cin >> N;
  int v = N * 1.08;

  if (v == 206) {
    puts("so-so");
  } else if (v < 206) {
    puts("Yay!");
  } else {
    puts(":(");
  }
  return 0;
}
