/*
**    author : Dhiraj Govindvira
**      date : 19 June 2021 ~ Saturday
**      time : 05:30:08 PM
*/

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

#ifdef DHIRAJ
    #include "D:/dhiraj/Programming/debug.h"
#else
    #define dbg(...) 1
    #define cerr if(0) cerr
#endif

using ll = long long int;
#define endl '\n'

template <typename T, typename U>
inline istream & operator >> (istream &in, pair<T, U> &p) {
    in >> p.first >> p.second;
    return in;
}
template <typename T>
inline istream & operator >> (istream &in, vector<T> &v) {
    for(T &x : v) in >> x;
    return in;
}

void solve(ll &tc)
{
    ll n;
    cin >> n;

    n = 1.08 * n;
    if(n == 206) {
        cout << "so-so" << endl;
    }
    else if(n < 206) {
        cout << "Yay!" << endl; 
    }
    else {
        cout << ":(" << endl;
    }
}

int main()
{
    #ifdef DHIRAJ
        freopen("D:/dhiraj/Programming/i1.txt", "r", stdin);
        freopen("D:/dhiraj/Programming/o1.txt", "w", stdout);
        freopen("D:/dhiraj/Programming/e1.txt", "w", stderr);
    #endif

    ios::sync_with_stdio(0);
    cin.tie(0);

    ll rep = 3;
    while(rep--) {
        ll tc = 1;
        for(ll i = 1; i <= tc; i++) {
            // cout << "Case #" << i << ": ";
            cerr << "Case #" << i << "\n";
            solve(i);
        }
        if(dbg()) break;
    }
    return 0;
}
#include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>

#define all(v) begin(v), end(v)
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, n, m) for (ll i = n; i <= m; ++i)
#define rep3(i, n, m) for (ll i = n; i >= m; --i)

using namespace std;

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

template <class S> using pqg = priority_queue<S, vector<S>, greater<S>>;
template <class S> using pq  = priority_queue<S>;

using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pi = pair<int,int>;
using pl = pair<ll, ll>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvpi = vector<vpi>;
using vvpl = vector<vpl>;

const ll MOD = 1000000007;
const ll MAX = 500000;
const ll INF = 1000000000;
const ll INFLL = 1000000000000000000;

struct mint {
  ll x;

  mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
  mint operator+=(const mint& a) {
    x += a.x;
    if (x >= MOD) x -= MOD;
    return *this;
  }
  mint operator-=(const mint& a) {
    if (x < a.x) x += MOD;
    x -= a.x;
    return *this;
  }
  mint operator*=(const mint& a) {
    x = x * a.x % MOD;
    return *this;
  }
  mint operator/=(const mint& a) { return *this *= a.inv(); }
  mint operator+(const mint& a) const { return mint(*this) += a; }
  mint operator-(const mint& a) const { return mint(*this) -= a; }
  mint operator*(const mint& a) const { return mint(*this) *= a; }
  mint operator/(const mint& a) const { return mint(*this) /= a; }
  mint inv(void) const { return pow(MOD - 2); }
  mint pow(ll a) const {
    if (!a) return 1;
    mint t = pow(a >> 1);
    t *= t;
    if (a & 1) t *= (*this);
    return t;
  }
  friend ostream& operator<<(ostream& os, const mint& a) {
    os << a.x;
    return os;
  }
};

struct UnionFind {
  vector<int> parent, siz;

  UnionFind(int n) : parent(n), siz(n, 1) {
    for (int i = 0; i < n; ++i) parent[i] = i;
  }

  int root(int x) {
    if (parent[x] == x) return x;
    return parent[x] = root(parent[x]);
  }

  bool unite(int x, int y) {
    x = root(x);
    y = root(y);

    if (x == y) return false;

    if (siz[x] > siz[y]) swap(x, y);

    siz[y] += siz[x];
    parent[x] = y;

    return true;
  }

  int size(int x) {
    return siz[root(x)];
  }

  bool same(int x, int y) {
    return root(x) == root(y);
  }
};

int main(void) {

  int n;
  cin >> n;

  int x = n * 1.08;
  if (x < 206) cout << "Yay!" << endl;
  else if (x == 206) cout << "so-so" << endl;
  else cout << ":(" << endl;

  return (0);
}

