#include<iostream>
#include<vector>
#include<map>
#include<stack>
#include<set>
#include<queue>
#include<stdlib.h>
#include<math.h>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<sstream>
#define endl "\n"
#define Doura() ios_base::sync_with_stdio(false),cin.tie(NULL), cout.tie(NULL)
#define ll long long
using namespace std;
const long long MXX=1e7;
bool isPalindrome(string s)
{
     string s1=s;
     reverse(s.begin(),s.end());
     return s1==s;
}
void kajelag()
{
     string s;
     cin>>s;
     if(isPalindrome(s))
     {
          cout<<"Yes"<<endl;
          return;
     }
     int leading0=0,last0=0;
     for(int i=0;i<s.size();i++)
     {
          if(s[i]!='0')
               break;
          else leading0++;
     }
     for(int i=s.size()-1;i>=0;i--)
     {
          if(s[i]!='0')
               break;
          else last0++;
     }
     if(last0>leading0)
     {
          int dif=last0-leading0;
          string s1="";
          for(int i=0;i<dif;i++)
               s1+='0';
          s1+=s;
          if(isPalindrome(s1))
          {
               cout<<"Yes"<<endl;
               return;
          }
          cout<<"No"<<endl;
     }
     else cout<<"No"<<endl;
}
int main()
{
      Doura();
     #ifndef ONLINE_JUDGE
             freopen("input.txt","r",stdin);
             freopen("output.txt","w",stdout);
     #endif // ONLINE_JUDGE

     int t;
    // cin>>t;
    // while(t--)
     {
          kajelag();
     }
     return 0;
}

#include<bits/stdc++.h>
#define ll long long 
#define ld long double
#define f first
#define s second
#define FSD ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
const int mod=998244353;
const int maxN=1e6+1;
const ll inf=1e18+1;
int main(){
    int n;
    cin>>n;
    int nt = 1.08 * n;
    if(nt < 206){
        cout<<"Yay!\n";
    }
    else if(nt == 206){
        cout<<"so-so\n";
    }
    else{
        cout<<":(\n";
    }
}