#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <cmath>

using namespace std;

#define rep(i, s, n) for (int i = s; i < (int)(n); i++)
#define drep(i, s ,n) for(int i=s;i>=(int)(n);--i)
#define rep64(i, s, n) for (long long i = s; i < (long long)(n); i++)
#define repIt(it, container) for (auto it = container.begin(); it != container.end(); it++)
#define vecprint(v) rep(i,0,v.size()-1)cout << v[i] << " ";cout << endl;
#define mod 1000000007


int main() {

    int N;

    cin >> N;

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

    return 0;
}

#include <iostream>
#include <cstdio>
#include <cmath>
#define int long long
using namespace std;
int read() {
	int re = 0;
	bool sig = 0;
	char c = getchar();
	while(c < '0' || c > '9')	sig = (sig | (c == '-')) , c = getchar() ;
	while(c >= '0' && c <= '9')	re = (re << 1) + (re << 3) + c - '0' , c = getchar();
	return sig ? -re : re;
}
int n;
signed main() {
	int x = ((int)floor(1.08 * read()) - 206);
	if(x < 0) puts("Yay!");
	else if(x == 0)	puts("so-so");
	else	puts(":(");
	return 0;
}