#include <iostream>
#include <vector>
#include <cmath>
#include<algorithm>
using namespace std;
#define endl '\n'
#define vi vector <ll>
#define ll long long int 
#define fast ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0) 

int main()
{   fast; 
    
  ll t;
  cin>>t;
  ll x= 1.08 * t;
   if( x< 206)
   cout<<"Yay!";
 else if(x == 206)
   cout<<"so-so";
 else
  cout<<":(";


 

   
}
#include <bits/stdc++.h>
using namespace std; 
#define int long long
#define forn(n) for(int i=0;i<n;i++)
#define pb push_back
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;
}
void solve(){
    int n;cin>>n;set<int>s;
    for(int i=2;i<=pow(n,0.5)+5;i++){
        for(int j=2;j<24/log(i);j++){
            if(binpow(i,j)<=n){s.insert(binpow(i,j));cerr<<i<<" "<<j<<endl;}
        }
    }
    cout<<n-(int)s.size()<<endl;
}
int32_t main() { 
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL);cout.tie(NULL);cerr.tie(NULL);
    solve();
    return 0;
} 