#include <bits/stdc++.h>
using namespace std;

int N;

int main(){
  cin >> N;

  if (N * 108 / 100 < 206)puts("Yay!");
  else if (N * 108 / 100 == 206)puts("so-so");
  else puts(":(");

  return 0;
}

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n) for (int i = k; i < n; i++)
using namespace std;
using ll = long long;

vector<pair<int, int> > prime_factorize(int N) {
    vector<pair<int, int> > res;
    for (int a = 2; a * a <= N; ++a) {
        if (N % a != 0) continue;
        int ex = 0;

        while (N % a == 0) {
            ++ex;
            N /= a;
        }
        res.push_back({a, ex});
    }
    if (N != 1) res.push_back({N, 1});
    return res;
}

vector<int> divisors(int n){
    vector<int> res;
    for(int i=1; i*i <= n; i++){
        if(n%i == 0){
            res.push_back(i);
            if(n/i != i) res.push_back(n/i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}

int main (){
    int k;
    cin >> k;
    int a, b, c;
    
    int ans = 0;

    repk(i, 1, k+1){
        repk(j, 1, k+1){
            if(i*j > k) break;
            repk(l, 1, k+1){
                if(i*j*l>k) break;
                if(i*j*l <=k) ans++;
            }
        }
    }    

    cout << ans << endl;
    return 0;
}