#include<iostream>
#include<bits/stdc++.h>
#include<climits>
#include<cmath>
#include<set>
 
 
using namespace std;

long long binpow(long long a, long long b) {
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}



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

using namespace std;


#define rep(i,j,k) for(long long int i=(long long int)j;i<(long long int)k;i++)
#define MOD 1000000007
#define pb push_back
#define fi first
#define se second
typedef long long lld;
typedef long ld;
#define inf LLONG_MAX
const lld MAXN = (int)3e5 + 5;

typedef pair<lld, lld> pii;
ld gcd(ld a, ld b)
{
    if(b==0)
    return a;
    return gcd(b,a%b);
}
lld power(lld x, lld y) 
{ 
    lld res = 1; 
    while (y > 0) { 
       
        if (y & 1) 
            res = (res * x) % MOD; 
        y = y >> 1; 
        x = (x * x) % MOD; 
    } 
    return res; 
} 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    lld n;
    cin>>n;
    lld ans=n;
    map<lld,lld> m;
    rep(i,2,sqrt(n)+1)
    {
        lld j=i*i;
        while(j<=n)
        {
        m[j]++;
        
         if(m[j]==1)
         ans--;
//cout<<j<<endl;
          j*=i;
        }
    }
    cout<<ans<<endl;
    
    return 0;
}
