//#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define IO (ios::sync_with_stdio(false), cin.tie(0), cout.tie(0))
#define inf 0x3f3f3f3f
#define ll long long
#define pii pair<int, int>
#define vs vector<int>
#define pk push_back
#define vss vector<vector<int> >
#define sz(x) (int)(x).size()
#define mk(a, b) make_pair(a, b)
#define rep(a, b, c) for(register int a = b; a <= c; ++ a)
#define per(a, b, c) for(register int a = b; a >= c; -- a)
using namespace std;



template<class T>
inline void read(T &x)
{
	x = 0; T f = 1; char c = getchar();
	while(c < '0' || c > '9') { if(c == '-') f = -1; c = getchar(); }
	while(c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	x *= f; 
}
 
template<class T>
inline void print(T x){
    if(x < 0) x = ~x + 1, putchar('-');
    if(x > 9) print(x / 10);
    putchar(x % 10 + '0');
}

int main()
{
	int n;
	cin >> n;
	
	n = n * 1.08;
	if(n < 206) puts("Yay!");
	else if(n == 206) puts("so-so");
	else puts(":(");
	
	return 0;
}
#include <bits/stdc++.h>
using namespace std;

int main()
{
    string s;
    cin >> s;

    bool flag = true;
    for (int i = 0; 2*i <= s.length(); i++)
    {
        if (s[2*i] >= 65 && s[2*i] <= 90)
        {
            flag = false;
        }
    }

    for (int i = 0; 2*i+1 <= s.length(); i++)
    {
        if (s[2*i+1] >= 97 && s[2*i+1] <= 122)
        {
            flag = false;
        }
    }
    if (flag)
    {
        cout <<"Yes" << endl;
    }
    else
    {
        cout << "No" << endl;
    }
    
    return 0;
}