#include<bits/stdc++.h>
#define PI 3.141592653589793238462
#define eps 1e-20
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdd;
int main(){
    ll n,ans=2e18;cin>>n;
    for(ll i=0;i<=60;i++){
        ll v=((ll)1<<i);
        ll a=n/v,c=n%v;
        ans=min(ans,a+c+i);
    }
    cout<<ans<<endl;
}
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <vector>
#include <queue>
#include <functional>
using namespace std;
using ll = long long;
using Graph = vector<vector<int> >;
using P = pair<int, int>;
#define INF 2000000000

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