#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
typedef long long int ll;
typedef long double ld;
#define MOD 1000000007
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(), a.rend()
#define no cout << "NO" << endl
#define yes cout << "YES" << endl
#define ff first
#define ss second
#define ceil2(x,y) (x+y-1) / y

#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl;
#else
#define debug(x)
#endif

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}

void solve()
{
    ll n; cin >> n;
    ll ans = floor(1.08*n);
    if(ans < 206){
        cout << "Yay!" << endl;
    }
    else if(ans == 206){
        cout << "so-so" << endl;
    }
    else{
        cout << ":(" << endl;
    }
}

signed main()
{
#ifndef ONLINE_JUDGE
    freopen("D:/Competitive Programming/input.txt", "r", stdin);
    freopen("D:/Competitive Programming/output.txt", "w", stdout);
#endif
    fastio;
    solve();
    return 0;
}
#include <algorithm>
#include <iostream>
#include <list>
#include <numeric>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <iterator>
#include <ostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <queue>
#include <cstdio>
using namespace std;
 
#define rep(i, n) for(int i = 0; i < n; ++i)
typedef long long ll;
 
template<class T> string toString(T n){ostringstream ost;ost<<n;ost.flush();return ost.str();}
int toInt(string s){int r=0;istringstream sin(s);sin>>r;return r;}
long long toInt64(string s){long long r=0;istringstream sin(s);sin>>r;return r;}
 
string res;
string s;
 
int main() {
    ios::sync_with_stdio();
    cin.tie(0);
    cin>>s;
    string res;
    res = "";
    for(int i = 0; i < (int)s.size(); ++i){
        if(s[i] == '.'){cout<<res<<endl; return 0;}
        res += s[i];
    }
    cout<<res<<endl;
    return 0;
}