#include <iostream>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>

using namespace std;
const int INF = 1 * (1 << 30);
const int mINF = -1 * (1 << 30);

int main()
{
  double n;
  cin >> n;
  n *= 1.08;
  int tmp = (int)n;
  if (tmp < 206)
  {
    cout << "Yay!" << endl;
  }
  else if (tmp == 206)
  {
    cout << "so-so" << endl;
  }
  else
  {
    cout << ":(" << endl;
  }
  return 0;
}

# define _GLIBCXX_DEBUG
# define rep(i, n) for (int i=0; i<(int)(n); i++)
# define FOR(i,a,b) for(int i=(a);i<=(b);++i)
# define ALL(a) (a).begin(), (a).end()
# define COUT(x) cout << (x) << endl;
# define KAI() cout << endl;
# define INF 10000000000000000LL
typedef long long ll;
# include <iostream>
# include <string>
# include <cmath>
# include <algorithm>
# include <vector>
# include <set>
# include <bitset>
using namespace std;

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

    double ans;

    ans = floor(1.08*n);

    // int ans=0;
    if (ans < 206) COUT("Yay!")
    else if (ans == 206) COUT("so-so")
    else COUT(":(")
}
