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

ll combination(int n, int k) {
  ll answer = 1;
  for (int i = 1; i <= k; i++) {
    answer *= n--;
    answer /= i;
  }
  return answer;
}

// write your code here!

int main() {
  double n;
  cin >> n;

  ll price = n * 1.08;

  if (price < 206)
    cout << "Yay!" << endl;
  else if (price > 206)
    cout << ":(" << endl;
  else
    cout << "so-so" << endl;
}

/*Allah Vorosha*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define in insert
#define rev reverse
#define all(x) (x).begin(),(x).end()
#define all2(x) (x).rbegin(),(x).rend()
#define sz(v) (int)v.size()
#define yes cout << "YES\n"
#define no cout << "NO\n";
#define take for(auto &it : a) cin >> it;
#define vi vector<int>
#define vii vector<pair<int, int > >
#define vl vector<ll>
#define fi first
#define se second
#define l_b lower_bound
#define u_b upper_bound
#define ed printf("\n")
#define mems(a, b) memset(a, b, sizeof(a))
#define ios ios_base::sync_with_stdio(0);cin.tie();cout.tie();

using namespace std;

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

template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void read(T &x) { cin >> x; }
template<class T, class ...U> void read(T &x, U& ... u) { read(x); read(u...); }
template<class T> void print1(const T &x) { cout << x << '\n'; }
template<class T, class ...U> void print1(const T &x, const U& ... u) { print1(x); print1(u...); }
template<class T> void print2(const T &x) { cout << x << ' '; }
template<class T, class ...U> void print2(const T &x, const U& ... u) { print2(x); print2(u...); }

const int N = 2e5 + 5, mod = 1e9 + 7, M = 5e5 + 5;
const ll inf = 9e18;
int cs = 1;

bool sortbysec(const pair<int,int> &a,
              const pair<int,int> &b)
{
    return (a.second < b.second);
}

void solve() {
    int n;
    read(n);
    int cost = 1.08 * n;
    n = cost;
    if(n == 206) print1("so-so");
    else if(n < 206) print1("Yay!");
    else print1(":(");
}

int main() {
    ios;
    /*int tc;
    read(tc);
    while(tc--> 0)*/
    solve();
    return 0;
}
